D1 Route inspection PhysicsAndMathsTutor.

com

1. (a) Explain why a network cannot have an odd number of vertices of odd degree.
(2)

The figure above shows a network of paths in a public park. The number on each arc represents
the length of that path in metres. Hamish needs to walk along each path at least once to check
the paths for frost damage starting and finishing at A. He wishes to minimise the total distance
he walks.

(b) Use the route inspection algorithm to find which paths, if any, need to be traversed twice.
(4)

(c) Find the length of Hamish’s route.

[The total weight of the network in Figure 4 is 4180m.]
(1)
(Total 7 marks)

Edexcel Internal Review 1

D1 Route inspection PhysicsAndMathsTutor.com

2.

[The total weight of the network is 73.3 km]

The diagram above models a network of tunnels that have to be inspected. The number on each
arc represents the length, in km, of that tunnel.
Malcolm needs to travel through each tunnel at least once and wishes to minimise the length of
his inspection route.
He must start and finish at A.

(a) Use the route inspection algorithm to find the tunnels that will need to be traversed twice.
You should make your method and working clear.
(5)

(b) Find a route of minimum length, starting and finishing at A.

State the length of your route.

(3)

Edexcel Internal Review 2

D1 Route inspection PhysicsAndMathsTutor.com

A new tunnel, CG, is under construction. It will be 10 km long.

Malcolm will have to include the new tunnel in his inspection route.

(c) What effect will the new tunnel have on the total length of his route?
Justify your answer.
(2)
(Total 10 marks)

3.

[The total weight of the network is 625 m]

The diagram above models a network of paths in a park. The number on each arc represents the
length, in m, of that path.
Rob needs to travel along each path to inspect the surface. He wants to minimise the length of
his route.

(a) Use the route inspection algorithm to find the length of his route. State the arcs that
should be repeated. You should make your method and working clear.
(6)

Edexcel Internal Review 3

D1 Route inspection PhysicsAndMathsTutor.com

The surface on each path is to be renewed. A machine will be hired to do this task and driven
along each path.
The machine will be delivered to point G and will start from there, but it may be collected from
any point once the task is complete.

(b) Given that each path must be traversed at least once, determine the finishing point so that
the length of the route is minimised. Give a reason for your answer and state the length of
your route.
(3)
(Total 9 marks)

4. (a) Draw the activity network described in this precedence table, using activity on arc and
exactly two dummies.

Activity Immediately preceding activities

A –
B –
C –
D B
E B, C
F B, C
G F
H F
I G, H
J I
(5)

(b) Explain why each of the two dummies is necessary.

(2)
(Total 7 marks)

Edexcel Internal Review 4

D1 Route inspection PhysicsAndMathsTutor.com

5.

(The total weight of the network above is 543 km.)

The diagram above 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)
(Total 8 marks)

Edexcel Internal Review 5

D1 Route inspection PhysicsAndMathsTutor.com

7.

C 11 I
10
F
10 12
8
B
E H
11 12
6 11
10

G
A 9
15 D

The diagram above models a network of underground tunnels that have to be inspected. The
number on each arc represents the length, in km, of each tunnel.

Joe must travel along each tunnel at least once and the length of his inspection route must be
minimised.

The total weight of the network is 125 km.

The inspection route must start and finish at A.

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

Given that 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.
(2)
(Total 7 marks)

8. (a) Explain why a network cannot have an odd number of vertices of odd degree.
(2)

Edexcel Internal Review 7

D1 Route inspection PhysicsAndMathsTutor.com

B 410 G

350 E 330 210

190
320
340 230
C 200 H
60 150
180 I
A 220
140 210
160 F
250
D 230

The diagram above shows a network of paths in a public park. The number on each arc
represents the length of that path in metres. Hamish needs to walk along each path at least once
to check the paths for frost damage starting and finishing at A. He wishes to minimise the total
distance he walks.

(b) Use the route inspection algorithm to find which paths, if any, need to be traversed twice.
(4)

(c) Find the length of Hamish’s route.

[The total weight of the network in Figure 4 is 4180 m.]
(1)
(Total 7 marks)

Edexcel Internal Review 8

D1 Route inspection PhysicsAndMathsTutor.com

9.

B 33 E
19
25 20
24 H
21 D
A
15 29

42
G
25
44 30
17

I
C 19 31
F

The figure above shows a network of pipes represented by arcs. The length of each pipe, in
kilometres, is shown by the number on each arc. The network is to be inspected for leakages,
using the shortest route and starting and finishing at A.

(a) Use the route inspection algorithm to find which arcs, if any, need to be traversed twice.
(4)

(b) State the length of the minimum route.

[The total weight of the network is 394 km]
(1)

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

(c) State, with a reason, which two vertices should be chosen to minimise the length of the
new route.
(2)
(Total 7 marks)

Edexcel Internal Review 9

D1 Route inspection PhysicsAndMathsTutor.com

10.
A B C D E F G
A — 48 117 92 — — —
B 48 — — — — 63 55
C 117 — — 28 — — 85
D 92 — 28 — 58 132 —
E — — — 58 — 124 —
F — 63 — 132 124 — —
G — 55 85 — — — —

The table shows the lengths, in metres, of the paths between seven vertices A, B, C, D, E, F and
G in a network N.

(a) Use Prim's algorithm, starting at A, to solve the minimum connector problem for this
table of distances. You must clearly state the order in which you selected the edges of
your tree, and the weight of your final tree. Draw your tree using the vertices given in the
diagram below.

C
B

A D

E
G
F
(5)

Edexcel Internal Review 10

D1 Route inspection PhysicsAndMathsTutor.com

(b) Draw N using the vertices given in the diagram below.

C
B

A D

E
G
F
(3)

(c) Solve the Route Inspection problem for N. You must make your method and working
clear. State a shortest route and find its length.

(The weight of N is 802)

Shortest route:
.........................................................................................................................

Length:
....................................................................................................................................
(7)
(Total 15 marks)

Edexcel Internal Review 11

D1 Route inspection PhysicsAndMathsTutor.com

12.

B 147 F

124 118
95
75
A 101 102 H
C E

125 74 135
67 78

G
D

The diagram above 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.

B 147 F

124 118
95
75
A C 101 E H
102

78
125 74 67 135 KEY
D G Order of Final
Vertex
labelling value

Working values

(5)

(ii) Solve the route inspection problem for the network shown in the diagram. 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)
(Total 11 marks)

Edexcel Internal Review 13

D1 Route inspection PhysicsAndMathsTutor.com

13.

7 8

9
D G

17
13 7
B1

B2
C F
21
3 14

10 11
9

The diagram above shows a network of roads connecting villages. The length of each road, in
km, is shown. Village B has only a small footbridge over the river which runs through the
village. It can be accessed by two roads, from A and D.

The driver of a snowplough, based at F, is planning a route to enable her to clear all the roads of
snow. The route should be of minimum length. Each road can be cleared by driving along it
once. The snowplough cannot cross the footbridge.

Showing all your working and using an appropriate algorithm,

(a) find the route the driver should follow, starting and ending at F, to clear all the roads of
snow. Give the length of this route.
(7)

Edexcel Internal Review 14

D1 Route inspection PhysicsAndMathsTutor.com

The local authority decides to build a road bridge over the river at B. The snowplough will be
able to cross the road bridge.

(b) Reapply the algorithm to find the minimum distance the snowplough will have to travel
(ignore the length of the new bridge).
(3)
(Total 10 marks)

14.

40

C 25 G
18 E 12
21
19
42 A 13

26 B
18
15
D
9
F

(a) Describe a practical problem that could be modelled using the network in the diagram
above and solved using the route inspection algorithm.
(1)

(b) Use the route inspection algorithm to find which paths, if any, need to be traversed twice.
(4)

(c) State whether your answer to part (b) is unique. Give a reason for your answer.
(1)

(d) Find the length of the shortest inspection route that traverses each arc at least once and
starts and finishes at the same vertex.
(1)

Edexcel Internal Review 15