This is an old revision of the document!
4.6. Implementing Kruskal's Algorithm: The Union-Find Data Structure
- The basic idea behind the algorithm is that the graph in question has a fixed population of nodes
- And the graphs grows over time by inserting edges between certain pairs of nodes.
- Goal: Maintain a set of connected components of the graph being processed throughout the whole operation
