Compare traditional Dijkstra's algorithm with ML-based pathfinding approaches. Create your own graph or use the sample, then watch the algorithms find the shortest path.
Source
Destination
Visited
Current
Path
Simulation Controls
Dijkstra's Algorithm
Guarantees shortest path using priority queue
Current Step
No step information available. Start the simulation to see details.
Algorithm Comparison
Dijkstra's Algorithm
• Guarantees shortest path
• Uses priority queue (optimal)
• Explores systematically
• Time: O((V + E) log V)
ML-Based Approach
• Uses heuristic + learning
• May find good paths faster
• Can make suboptimal choices
• Adaptable to patterns
How to Use
Graph Creation:
• Click "Add Node" and click on canvas to add nodes
• Click "Add Edge" and click two nodes to connect them
• Use "Set Source" and "Set Destination" to mark start/end
• Drag nodes to reposition them
Simulation:
• Choose between Dijkstra or ML-based algorithm
• Select step-by-step, auto-play, or complete mode