Pathfinding Visualizer

Explore and compare different pathfinding algorithms with interactive visualization

Algorithm Selection

Optimal

Guarantees shortest path, explores uniformly. Optimal for weighted graphs.

Animation Speed

Slow50msFast

Grid Size

10×1025×2550×50

Weighted Nodes

Enable nodes with higher traversal cost

Drawing Mode

Please place both start (green) and end (red) nodes to begin visualization

Quick Tips: Use keyboard shortcuts for faster interaction. Hover over elements for detailed information. Try different algorithms to compare their behavior!