D1 June 2015 Q3

EdexcelOld spec10 marksShortest Path

3.

Figure 3: weighted network of roads with vertices A to J
Figure 3

Figure 3 represents a network of roads. The number on each arc is the length, in km, of the corresponding road.

(a) Use Dijkstra’s algorithm to find the shortest route from A to J. State the shortest route and its length. (6)
(b) Explain how you determined the shortest route from your labelled diagram. (2)
(c) Find the shortest route from A to J via E and state its length. (2)