Minimum Spanning Tree

Chapter 23
Minimum Spanning Trees

• Find a minimum-cost set of edges that connect all
vertices of a graph
• Applications
– Connect “nodes” with a minimum of “wire”
• Networking
• Circuit design
2
vertices of a graph
• Applications
– Collect nearby nodes
• Clustering, taxonomy construction
3
vertices of a graph
• Applications
– Approximating graphs
4
• A tree is an acyclic, undirected, connected graph
• A spanning tree of a graph is a tree containing all

vertices from the graph
• A minimum spanning tree is a spanning tree,

where the sum of the weights on the tree’s edges
are minimal
5
• A minimum spanning tree is a spanning tree,

where the sum of the weights on the tree’s edges
are minimal
6
• Problem formulation
– Given an undirected, weighted graph with
weights for each edge
– Find an acyclic subset that connects all of the
vertices and minimizes the total weight:
– The minimum spanning tree is

• Minimum spanning tree may be not unique (can be more than
one)
7
• Both Kruskal’s and Prim’s Algorithms work with
undirected graphs
• Both work with weighted and unweighted graphs but
are more interesting when edges are weighted
• Both are greedy algorithms that produce optimal
solutions
8
• Solution 1: Kruskal’s algorithm
– Work with edges
– Two steps:
• Sort edges by increasing edge weight
• Select the first |V| - 1 edges that do not generate a cycle
– Walk through:
3
10 F C
4 3
A 4
8
6
5
4 B D
4
H 1
2
3
G 3 E
9
Sort the edges by increasing edge weight

3
10 F C edge dv edge dv
4 3 (D,E) 1 (B,E) 4
A 4
8
6 (D,G) 2 (B,F) 4
5
4 B D (E,G) 3 (B,H) 4
4
H (C,D) 3 (A,H) 5
1
2
3 (G,H) 3 (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
10
Select first |V|–1 edges which do not
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
8 4
6 (D,G) 2 (B,F) 4
5
4 B D (E,G) 3 (B,H) 4
4
H (C,D) 3 (A,H) 5
1
2
3 (G,H) 3 (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
11
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3 (B,H) 4
4
H (C,D) 3 (A,H) 5
1
2
3 (G,H) 3 (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
12
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H (C,D) 3 (A,H) 5
1
2
3 (G,H) 3 (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
Accepting edge (E,G) would create a cycle
13
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3 (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
14
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3 (A,B) 8
(B,C) 4 (A,F) 10
15
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4 (A,F) 10
16
generate a cycle
3
A 4 3 (D,E) 1  (B,E) 4
4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
17
generate a cycle
3
4 3 (D,E) 1  (B,E) 4 
A 4
8
6 (D,G) 2  (B,F) 4
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
18
generate a cycle
3
4 3 (D,E) 1  (B,E) 4 
A 4
8
6 (D,G) 2  (B,F) 4 
5
4 B D (E,G) 3  (B,H) 4
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
19
generate a cycle
3
4 3 (D,E) 1  (B,E) 4 
A 4
8
6 (D,G) 2  (B,F) 4 
5
4 B D (E,G) 3  (B,H) 4 
4
H 1
(C,D) 3  (A,H) 5
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
20
generate a cycle
3
4 3 (D,E) 1  (B,E) 4 
A 4
8
6 (D,G) 2  (B,F) 4 
5
4 B D (E,G) 3  (B,H) 4 
4
H 1
(C,D) 3  (A,H) 5 
2
3 (G,H) 3  (D,F) 6
G 3 E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
21
generate a cycle
3
F C edge dv edge dv
3 (D,E) 1  (B,E) 4 
A 4
(D,G) 2  (B,F) 4 
5
B D (E,G) 3  (B,H) 4 
H (C,D) 3  (A,H) 5 
considered
1
2
3 (G,H) 3  (D,F) 6
}
not
G E (C,F) 3  (A,B) 8
(B,C) 4  (A,F) 10
Done
Total Cost = 21 22
• Solution 2: Prim’s algorithm
– Work with nodes (instead of edges)
– Two steps
• Select node with minimum distance
• Update distances of adjacent, unselected nodes
– Walk through: 2
10 F C
7 3
A 4
8
18
4
9 B D
10
H 25
2
3
G 7 E 23
Initialize array
3
10 F C K dv pv
7 3 A F  
A 4
8
18 B F  
4
9 B D C F  
10
H 25
D F  
2
3 E F  
G 7 E F F  
G F  
K : whether in the tree H F  
dv : distance to the tree
pv : closest node that is in the tree 24
Start with any node, say D

3
10 F C K dv pv
7 3 A
A 4
8
18 B
4
9 B D C
10
H 25
D T 0 
2
3 E
G 7 E F
G
H
25
2 Update distances of
adjacent, unselected nodes
3
10 F C K dv pv
7 3 A
A 4
8
18 B
4
9 B D C 3 D
10
H 25
D T 0 
2
3 E 25 D
G 7 E F 18 D
G 2 D
H
26
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A
A 4
8
18 B
4
9 B D C 3 D
10
H 25
D T 0 
2
3 E 25 D
G 7 E F 18 D
G T 2 D
H
27
3
10 F C K dv pv
7 3 A
A 4
8
18 B
4
9 B D C 3 D
10
H 25
D T 0 
2
3 E 7 G
G 7 E F 18 D
G T 2 D
H 3 G
28
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A
A 4
8
18 B
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E 7 G
G 7 E F 18 D
G T 2 D
H 3 G
29
3
10 F C K dv pv
7 3 A
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E 7 G
G 7 E F 3 C
G T 2 D
H 3 G
30
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E 7 G
G 7 E F T 3 C
G T 2 D
H 3 G
31
3
10 F C K dv pv
7 3 A 10 F
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E 2 F
G 7 E F T 3 C
G T 2 D
H 3 G
32
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A 10 F
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H 3 G
33
3
10 F C K dv pv
7 3 A 10 F
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H 3 G
Table entries unchanged

34
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A 10 F
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H T 3 G
35
3
10 F C K dv pv
7 3 A 4 H
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H T 3 G
36
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A T 4 H
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H T 3 G
37
3
10 F C K dv pv
7 3 A T 4 H
A 4
8
18 B 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H T 3 G
Table entries unchanged

38
2 Select node with

minimum distance
3
10 F C K dv pv
7 3 A T 4 H
A 4
8
18 B T 4 C
4
9 B D C T 3 D
10
H 25
D T 0 
2
3 E T 2 F
G 7 E F T 3 C
G T 2 D
H T 3 G
39
2 Cost of Minimum
Spanning Tree = 21
3
F C K dv pv
3 A T 4 H
A 4
B T 4 C
4
B D C T 3 D
H D T 0 
2
3 E T 2 F
G E F T 3 C
G T 2 D
H T 3 G
Done 40
• Runtime
– When using binary heaps, the runtime of the Kruskal’s
algorithm is
– When using binary heaps, the runtime of the Prim’s
algorithm is
When using the Fibonacci heaps, the runtime of the
Prim’s algorithm becomes:
– So, when an undirected graph is dense (i.e., is
much small than ), the Prim’s algorithm is more
efficient
41

Minimum Spanning Tree

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Minimum Spanning Tree

Uploaded by

Copyright:

Available Formats

Chapter 23

Minimum Spanning Trees

• A spanning tree of a graph is a tree containing all

• A minimum spanning tree is a spanning tree,

• A minimum spanning tree is a spanning tree,

– The minimum spanning tree is

Sort the edges by increasing edge weight

Accepting edge (E,G) would create a cycle

Start with any node, say D

2 Select node with

2 Select node with

2 Select node with

2 Select node with

Table entries unchanged

2 Select node with

2 Select node with

Table entries unchanged

2 Select node with

You might also like