Data Structures for Prim

• Adjacency Lists - we need to look at all the edges from a newly added vertex.

• Array for the best edges in or to the tree.

1

1

2

3

1

4

1

3

2

3

1 2 3 4 5 6 7

to

cost

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