Data Structures for Prim
Priority queue for all edges to the tree (blue edges).
Insert, delete-min, delete (e.g. binary heap).
1
6
5
4
7
2
3
3
3
4
0
2
2
1
3
1
3
1
6
5
4
7
2
3
3
3
4
0
2
2
1
3
1
3
1
1
2
3
1
4
1
3
2
3
1 2 3 4 5 6 7
to
cost
1
1
2
3
7
0
7
1
1
3
2
3
1 2 3 4 5 6 7
to
cost
Previous slide
Next slide
Back to first slide
View graphic version