- This practice is about the order in which nodes are visited (finalized) by Dijkstra's algorithm, starting from node A.
- It is not about the path to a specific destination, but the sequence in which each node's shortest distance from A is finalized.
- Enter A to start, then enter the next node that Dijkstra's algorithm would visit, based on the current shortest distances.
- After each correct entry, the graph and feedback will update. When all nodes are finalized, the correct order will be shown.
- Use the dropdown below to switch between different example graphs.
Note: The order may include nodes that are not directly
connected in the graph (e.g., E → C), because Dijkstra's algorithm
finalizes nodes based on the shortest known distance from A, not
direct adjacency.
Press Start, then enter the next node visited by Dijkstra's algorithm.