D1 January 2005 Q5

EdexcelOld spec11 marksRoute InspectionShortest Path

5.

Figure 3: network of paths on A to H
Figure 3

Figure 3 shows a network of paths. The number on each arc gives the distance, in metres, of that path.

(i) Use Dijkstra’s algorithm to find the shortest distance from \(A\) to \(H\). (5)
(ii) Solve the route inspection problem for the network shown in Figure 3. You should make your method and working clear. State a shortest route, starting at \(A\), and find its length.

[The total weight of the network is 1241]

(6)
‹ Previous39 of 39 in Route Inspection