Dijkstra's Algorithm Game — Shortest Path Challenge
Master Dijkstra's shortest path algorithm by predicting priority-queue extractions and edge relaxations on weighted graphs.
Time Complexity: O((V + E) log V)
Study the algorithm · Watch Visualizer · All Algorithm Games