D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.

com

1.

The network in the diagram above shows the distances, in metres, between 10 wildlife
observation points. The observation points are to be linked by footpaths, to form a network
along the arcs indicated, using the least possible total length.

(a) Find a minimum spanning tree for the network in the diagram above, showing clearly the
order in which you selected the arcs for your tree, using

(i) Kruskal’s algorithm,

(3)

(ii) Prim’s algorithm, starting from A.

(3)

Given that footpaths are already in place along AB and FI and so should be included in the
spanning tree,

(b) explain which algorithm you would choose to complete the tree, and how it should be
adapted.
(You do not need to find the tree.)
(2)
(Total 8 marks)

Edexcel Internal Review 1

D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.com

2.

The diagram above represents the distances, in metres, between eight vertices, A, B, C, D, E, F,
G and H, in a network.

(a) Use Kruskal’s algorithm to find a minimum spanning tree for the network.
You should list the arcs in the order in which you consider them. In each case, state
whether you are adding the arc to your minimum spanning tree.
(3)

(b) Complete the matrix below, to represent the network.

A B C D E F G H
A – 31 30 – – – – –
B 31 – – – – – 38
C 30 – – 24 – –
D – – 18 – –
E – – 24 18 – 28 –
F – – – 28 – 21 –
G – – – – 21 –
H – 38 – – – –
(2)

Edexcel Internal Review 2

D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.com

(c) Starting at A, use Prim’s algorithm to determine a minimum spanning tree. You must
clearly state the order in which you considered the vertices and the order in which you
included the arcs.
(3)

(d) State the weight of the minimum spanning tree.

(1)
(Total 9 marks)

3.
A B C D E F
A – 24 – – 23 22
B 24 – 18 19 17 20
C – 18 – 11 14 –
D – 19 11 – 13 –
E 23 17 14 13 – 21
F 22 20 – – 21 –

The table shows the distances, in metres, between six vertices, A, B, C, D, E and F, in a
network.

Edexcel Internal Review 3

D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.com

(a) Draw the weighted network using the vertices given in Diagram 1 below.

Diagram 1
(3)

(b) Use Kruskal’s algorithm to find a minimum spanning tree. You should list the edges in
the order that you consider them and state whether you are adding them to your minimum
spanning tree.
(3)

(c) Draw your tree on Diagram 2 below and find its total weight.

Diagram 2
(2)
(Total 8 marks)

Edexcel Internal Review 4

D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.com

4.

(a) State two differences between Kruskal’s algorithm and Prim’s algorithm for finding a
minimum spanning tree.
(2)

(b) Listing the arcs in the order that you consider them, find a minimum spanning tree for the
network in the diagram above, using

(i) Prim’s algorithm,

(ii) Kruskal’s algorithm.

(6)
(Total 8 marks)

5. (a)

18 20 11 7 17 15 14 21 23 16 9

The list of numbers shown above is to be sorted into ascending order. Apply quick sort to
obtain the sorted list. You must make your pivots clear.
(5)

Edexcel Internal Review 5

D1 Minimum connectors - Kruskal's PhysicsAndMathsTutor.com

E
21
17
G
B 14
11 9

18 11
7 F I
23 16
A 20 C
H
15
11

The diagram above represents a network of paths in a park. The number on each arc represents
the length of the path in metres.

(b) Using your answer to part (a) and Kruskal’s algorithm, find a minimum spanning tree for
the network in the diagram above. You should list the arcs in the order in which you
consider them and state whether you are adding it to your minimum spanning tree.
(4)

(c) Find the total weight of the minimum spanning tree.

(1)
(Total 10 marks)

Edexcel Internal Review 6