FibonacciHeap<'TPriority, 'TValue>
Namespace: QuickGraph.Collections
Constructors
| Constructor | Description |
new()
Signature: unit -> unit
|
|
new(Direction)
Signature: Direction:HeapDirection -> unit
|
|
new(Direction, priorityComparison)
Signature: (Direction:HeapDirection * priorityComparison:Comparison<'TPriority>) -> unit
|
Instance members
| Instance member | Description |
ChangeKey(node, newKey)
Signature: (node:FibonacciHeapCell<'TPriority,'TValue> * newKey:'TPriority) -> unit
|
|
Count
Signature: int
|
|
Delete(node)
Signature: node:FibonacciHeapCell<'TPriority,'TValue> -> unit
|
|
Dequeue()
Signature: unit -> KeyValuePair<'TPriority,'TValue>
|
|
Direction
Signature: HeapDirection
|
|
DrawHeap()
Signature: unit -> string
|
|
Enqueue(Priority, Value)
Signature: (Priority:'TPriority * Value:'TValue) -> FibonacciHeapCell<'TPriority,'TValue>
|
|
GetDestructiveEnumerator()
Signature: unit -> IEnumerable<KeyValuePair<'TPriority,'TValue>>
|
|
GetEnumerator()
Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
Modifiers: abstract |
|
IsEmpty
Signature: bool
|
|
Merge(other)
Signature: other:FibonacciHeap<'TPriority,'TValue> -> unit
|
|
PriorityComparison
Signature: Comparison<'TPriority>
|
|
Top
Signature: FibonacciHeapCell<'TPriority,'TValue>
|
