Dijkstra's Shortest Path Game

Test your knowledge of Dijkstra's algorithm by finding the shortest path between the start and end nodes.

Score
0
Level
1
Click on nodes to select your path from start to end.

How to Play:

  1. Click on nodes to create your path from the start node (green) to the end node (red).
  2. The goal is to find the path with the lowest total weight.
  3. Click "Check Path" to verify if your path is the shortest.
  4. Click "Reset Selection" to clear your current path.
  5. Click "New Game" to generate a new random graph.
  6. Click "Show Solution" to see the shortest path (but you'll get no points).