ForestDisjointSet<'T>
Namespace: QuickGraph.Collections
Disjoint-set implementation with path compression and union-by-rank optimizations. optimization
Constructors
| Constructor | Description |
new(elementCapacity)
Signature: elementCapacity:int -> unit
|
|
new()
Signature: unit -> unit
|
Instance members
| Instance member | Description |
AreInSameSet(left, right)
Signature: (left:'T * right:'T) -> bool
Modifiers: abstract |
|
Contains(value)
Signature: value:'T -> bool
Modifiers: abstract |
|
ElementCount
Signature: int
Modifiers: abstract |
|
FindSet(value)
Signature: value:'T -> 'T
Modifiers: abstract |
|
MakeSet(value)
Signature: value:'T -> unit
Modifiers: abstract |
Adds a new set |
SetCount
Signature: int
Modifiers: abstract |
|
Union(left, right)
Signature: (left:'T * right:'T) -> bool
Modifiers: abstract |
