Data Structures for Kruskal

• Sorted edge list

• Disjoint Union / Find

  • Union(a,b) - union the disjoint sets named by a and b
  • Find(a) returns the name of the set containing a

{7,4} {2,1} {7,5} {5,6} {5,4} {1,6} {2,7} {2,3} {3,4} {1,5}

0 1 1 2 2 3 3 3 3 4

Previous slide

Next slide

Back to first slide

View graphic version