D1 January 2009 Q5

EdexcelOld spec8 marksRoute Inspection

5.

Figure 3: network of railway tracks with vertices A to H and lengths in km
Figure 3

(The total weight of the network in Figure 3 is 543 km.)

Figure 3 models a network of railway tracks that have to be inspected. The number on each arc is the length, in km, of that section of railway track.

Each track must be traversed at least once and the length of the inspection route must be minimised.

The inspection route must start and finish at the same vertex.

(a) Use an appropriate algorithm to find the length of the shortest inspection route. You should make your method and working clear. (5)

It is now permitted to start and finish the inspection at two distinct vertices.

(b) State which two vertices should be chosen to minimise the length of the new route. Give a reason for your answer. (3)
‹ Previous31 of 39 in Route InspectionNext ›