For each of the following networks:

Use Dijkstra's algorithm to find a quickest route between the stated vertices

Indicate the order in which the vertices were labelled,

Show clearly how you determined your quickest route from your labelling.

Is the route you have found the only quickest route? Give a reason for your answer.

Shortest route between A and H

Shortest Route between S and T

Shortest route between A to J

Answers to questions

(i) Labelling order A C B D F E G H

Shortest Route A B F H

(ii) Labelling order S C B A E D G F T

Shortest Route S C E F T

(iii) Labelling order A B C D E F H G I J

Shortest Route J H E C A or

J H E D A