- Start: Click this button to begin the practice session. The graph will be initialized and you can start entering the order in which nodes are visited by Dijkstra's algorithm from the start node (A).
- Submit: After entering the next node in the input box, click this button to submit your answer. The system will check if your answer is correct and update your progress.
- Reset: Click this button to restart the practice session from the beginning. This will clear your progress and allow you to try again.
- Hint: If you are stuck, click this button to receive a hint for the next node to be visited. This button is enabled after you start the session.
- Use the input box to enter the label of the next node (single uppercase letter) that Dijkstra's algorithm would visit next. The order is based on the shortest known distance from A, not direct adjacency.
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.