39
Minimum Spanning Trees
| Date post: | 22-Dec-2015 |
| Category: |
Documents |
| View: | 221 times |
| Download: | 1 times |
Minimum Spanning Trees
a
b
d
f g
e
c
a
b
d
f g
e
c
a
b
d
f g
e
c
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
Minimum spanning tree weight = 0
Systematic Approach:
-Grow a spanning tree A
-Always add a safe edge to A that we know belongs to some minimal spanning tree
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R
There must go exactly one edge from b to the minimum spanning tree. Which edge should we choose?Are all three a possibility (maybe suboptimal)?Could the 7 edge be optimal to choose?What about the two 5 edges?
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R
There must go exactly one edge from b to the spanning tree. Which edge should we choose?Are all three a possibility? Yes, every vertex will connect to the tree Could the 7 edge be optimal to choose? No, we must connect with a light edgeWhat about the two 5 edges? The red is possible, but they both are !!
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’’
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’’’
Kruskal’s Algorithm
Idea:
Rethink the previous algorithm from vertices to edges
-Initially each vertex forms a singleton tree
-In each iteration add the lightest edge connecting two trees in the forest.
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
0
5
-1
8
0
R’’’
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
Time?
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
Time?
O(E*lgE)
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
Time?
O(E*lgE)
Theorem 21.13: m FindSet, Union, and MakeSet operations of which n are MakeSet operations takes O(m*α(n))
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
Time?
O(E*lg(E))
O(V+E*α(V)) =O(V+E*lg(V)) = O(V+E*lg(E)) =O(E*lg(E))
MSTkruskal(G,w)
1 A Ø
2 for each vertex v V[G]
3 do MakeSet(v)
4 sort the edges of E into nondecreasing order by weight w
5 for each edge (u,v) E, taken in nondecreasing order by weight
6 do if FindSet(u) FindSet(v)
7 then A A {(u,v)}
8 Union(u,v)
9 return A
O(E*lg(E))
O(E*lg(E))
O(V+E*α(V)) =O(V+E*lg(V)) = O(V+E*lg(E)) =O(E*lg(E))
a
b
d
f g
e
c
0
2
-3
-1
5
5
7
1
5
-1
8
0
R
Obviously tree. Which edge should we choose?
![b ] Z p b h g g Z y f m e v l b f ^ b c g Z y b k l f Zmydeancorp.com/upload/md_9xxx_user_manual_ru.pdf< h \ j _ f y w d k i e m Z l Z \ l h f h [ b e v g h g Z \ b ] Z p b h g g h](https://static.documents.pub/doc/80x56/6073f4d988616c0d851bdc52/b-z-p-b-h-g-g-z-y-f-m-e-v-l-b-f-b-c-g-z-y-b-k-l-f-h-j-f-y-w-d-k-i-e.jpg)
![= D - - K · H [ h a g Z q _ g b _ G Z b f _ g h \ Z g b _ I j b f _ q Z g b _ < _ ^ h f h k l v k k u e h q g u o b i j b e Z ] Z _ f u o ^ h d m f _ g l h \](https://static.documents.pub/doc/80x56/603690629ffbb42b905c497c/-d-k-h-h-a-g-z-q-g-b-g-z-b-f-g-h-z-g-b-i-j-b-f-q-z-g-b-.jpg)
![B A F ? J B L ? E V > : < E ? G B Y : A : N > -09 · G Z b f _ g h \ Z g b _, l b i, Z j d э Z e h g g- ] j _ ^ k l b a f _ j _ g b c e b i h f h ]- l _ь h ] j _ ^ k l](https://static.documents.pub/doc/80x56/5f8ff2cfa26b5769fe3d9d2a/b-a-f-j-b-l-e-v-e-g-b-y-a-n-09-g-z-b-f-g-h-z-g-b.jpg)
![F M G B P B I : E V G : Y I J H = J : F F · F M G B P B I : E V G : Y I J H = J : F F : « Z a \ b l b _ f Z e h ] b k j _ ^ g _ ] h i j _ ^ i j b g b f Z l _ e v k l \ Z g l _ j](https://static.documents.pub/doc/80x56/5f80171164862a0c1c0fee44/f-m-g-b-p-b-i-e-v-g-y-i-j-h-j-f-f-f-m-g-b-p-b-i-e-v-g-y-i-j-h-j-.jpg)
