Page "Disjoint-set data structure" Paragraph 53
from
Wikipedia
This data structure is used by the Boost Graph Library to implement its Incremental Connected Components functionality.
It is also used for implementing Kruskal's algorithm to find the minimum spanning tree of a graph.
Page 1 of 1.
2.341 seconds.