A2 June 2025 Q4

EdexcelCurrent spec13 marksRoute InspectionShortest Path

4.

Figure 2: network on offices A to K with edges AB 13, AC 5, AD 17, BC 6, BE 24, BF 10, BJ 39, CF 17, CG 9, CD 11, DG 1, DH 25, DK 19, EJ 10, FG 4, FK 13, GK 22, HK 7, JK 16
Figure 2

[The total weight of the network is 268]

Figure 2 represents a network of corridors between 10 offices, A, B, C, D, E, F, G, H, J and K, in a building. The number on each edge represents the length, in metres, of the corresponding corridor.

On Monday morning, Turvi needs to walk from J to K via A. She wishes to minimise the distance she travels along the corridors.

(a)
(i) Use Dijkstra’s algorithm, starting at A, to find the shortest route from J to K via A.
(ii) State the length of this route. (6)

On Monday afternoon, Turvi needs a route that traverses each corridor at least once. She plans to start at J and finish at A and wants to minimise the distance travelled.

(b)
(i) By considering the pairings of all relevant nodes, find the corridors that would need to be traversed twice. You must make your method and working clear.
(ii) State the total length of this route. (5)

Turvi discovers that she cannot walk along corridors AB, CD and JK because they are being decorated. Turvi walks from J to A travelling along all the other corridors at least once. She does this in the minimum distance possible.

(c) Determine the difference between the length of the route Turvi travels and the length of the route found in (b). You must make the values used in your calculation clear. (2)