Prim’s Algorithm

• We maintain a single tree.

• For each vertex not in the tree maintain the smallest edge to a vertex in the tree.

1

6

5

4

7

2

3

3

3

4

0

2

2

1

3

1

3

Previous slide

Next slide

Back to first slide

View graphic version