The following graph shows the routes connecting buildings on a university campus. The numbers represent the time taken (in minutes) to cycle from one building to another.

a) i) Use Dijkstra’s algorithm to find the minimum time to cycle from building A to building L.
ii) Write down the corresponding shortest route.
b) It has been decided to construct a new cycle path, either from A directly to D (cycle time 30 minutes) or from A directly to I (cycle time 20 minutes).
Identify the option that would reduce the cycle time from building A to building L by the greatest amount.

Transcribed Image Text:

A 15 B 10 E 20 15 20 F D 20 14 G 20 20 20 H K 15 L 12 12 12 12