Dijkstra Practice Tool A Level Further Maths (Decision 1)

Dragging: If the network looks crowded, click and drag nodes to rearrange them!
Start Box (S): Working value can be empty or 0.
Updates: Replace working values only if the new value is smaller .
Tracing: Path is valid if Final(B) - Final(A) = Weight(AB) .

Goal: Find the shortest path from the Start Node (S) to the Target Node (T).

Fill in the boxes as you perform Dijkstra's Algorithm. If you need a reminder of how this works, click the 'hint' box.

If the graph is too cluttered, drag node labels to move the node. The arc weights will move to avoid overlapping with nodes.