∞
Algo Infinity Verse
Interactive
Pathfinding Visualizer
Animate shortest path search algorithms on a custom grid
|
Start Node
Target Node
Wall Node
Weight (Cost = 5)
Unvisited Node
Visited Node
Shortest Path
Visualization Statistics
Visited Nodes
0
Total Iterations
0
Shortest Path Length
0
Total Path Cost
0
Execution Time
0ms
Execution State
Idle
Grid Drawing Tools
Active Tool
Draw Wall
Erase Wall
Place Weight
Clear Cell
Grid Configuration
Maze Algorithm
Random Scatter (Density)
Recursive Division (Perfect Maze)
Grid Size (Rows & Cols)
Obstacle Density
Generate Maze
Playback & Algorithms
Algorithm
Breadth First Search (BFS)
Depth First Search (DFS)
Dijkstra's Algorithm (Weighted)
A* Search (Weighted + Heuristic)
Allow Diagonal Movement
A* Heuristic
Manhattan Distance
Euclidean Distance
Chebyshev Distance
Compare Dijkstra vs A*
Step Delay
25ms
Play
Pause
Step
Replay
Clear Path
Reset Grid
Breadth First Search
Time Complexity
O(V + E)
Space Complexity
O(V)
Shortest Path Guarantee:
Yes (Unweighted)
Comparison Results
Dijkstra's Algorithm
Time:
0ms
Nodes:
0
A* Search
Time:
0ms
Nodes:
0
Execution Log
> Grid initialized. Drag start/target nodes or draw walls to configure.
3
Algo Assistant
Hi! I'm your DSA assistant. How can I help you today?
Time Complexity
Hint
Approach