Data Structures for Kruskal’s Algorithm

Pick the lowest cost edge…

findMin/deleteMin

If u and v are not already connected…

…connect u and v.

find representative

union

|E| times:

|E| times:

runtime:

Previous slide

Next slide

Back to first slide

View graphic version