Step 5 of 8 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 5Follow the worked example and explain why each modelling and calculation step is valid.
An undirected triangle has AB=2, BC=3 and AC=8. Use Dijkstra from A to find final distance labels and the shortest path to C.
An undirected triangle has AB = 2, BC = 3 and AC = 8.
Use Dijkstra's algorithm from A. Find the final distance labels and the shortest path to C.
Higher Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 5 of 8
Dijkstra’s algorithm finds shortest distances from a starting vertex by settling the smallest temporary label and updating its neighbours.
In an exam, a clear label table justifies shortest routes rather than merely guessing them from the diagram.
An undirected triangle has AB = 2, BC = 3 and AC = 8. Use Dijkstra's algorithm from A. Find the final distance labels and the shortest path to C.