# 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.

## Presentation on theme: "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."— Presentation transcript:

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 orderA C B D F E G H Shortest RouteA B F H (ii)Labelling orderS C B A E D G F T Shortest RouteS C E F T (iii)Labelling orderA B C D E F H G I J Shortest RouteJ H E C Aor J H E D A

Download ppt "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."

Similar presentations