Lines Matching refs:union

11 What is union-find, and what is it used for?
15 of disjoint sets. The primary operations supported by union-find are:
26 As a data structure used to maintain sets (groups), union-find is commonly
30 network routing. Consequently, union-find is widely referenced. Additionally,
31 union-find has applications in symbolic computation, register allocation,
37 the find operation, and using union by rank can reduce the time complexity
38 of the union operation. These optimizations reduce the average time
39 complexity of each find and union operation to O(α(n)), where α(n) is the
43 This document covers use of the Linux union-find implementation.  For more
44 information on the nature and implementation of union-find,  see:
46   Wikipedia entry on union-find
49 Linux implementation of union-find
52 Linux's union-find implementation resides in the file "lib/union_find.c".
55 The union-find data structure is defined as follows::
63 The rank field represents the height of the current tree. During a union
67 Initializing union-find
81 Find the Root Node of union-find
85 set in the union-find. If they have the same root, they are in the same set.
98 Union Two Sets in union-find
101 To union two sets in the union-find, you first find their respective root nodes