IDisjointSet<'T>
Namespace: QuickGraph.Collections
A disjoint-set data structure
Instance members
| Instance member | Description |
AreInSameSet(left, right)
Signature: (left:'T * right:'T) -> bool
Modifiers: abstract |
Gets a value indicating if left and right are contained in the same set |
Contains(value)
Signature: value:'T -> bool
Modifiers: abstract |
Gets a value indicating whether the value is in the data structure |
ElementCount
Signature: int
Modifiers: abstract |
Gets the current number of elements. |
FindSet(value)
Signature: value:'T -> 'T
Modifiers: abstract |
Finds the set containing the value |
MakeSet(value)
Signature: value:'T -> unit
Modifiers: abstract |
Creates a new set for the value |
SetCount
Signature: int
Modifiers: abstract |
Gets the current number of sets |
Union(left, right)
Signature: (left:'T * right:'T) -> bool
Modifiers: abstract |
Merges the sets from the two values |
