QuickGraph


BinaryHeap<'TPriority, 'TValue>

Namespace: QuickGraph.Collections

Binary heap

Constructors

ConstructorDescription
new()
Signature: unit -> unit
new(priorityComparison)
Signature: priorityComparison:Comparison<'TPriority> -> unit
new(capacity, priorityComparison)
Signature: (capacity:int * priorityComparison:Comparison<'TPriority>) -> unit

Instance members

Instance memberDescription
Add(priority, value)
Signature: (priority:'TPriority * value:'TValue) -> unit
Capacity
Signature: int
Count
Signature: int
GetEnumerator()
Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
Modifiers: abstract
IndexOf(value)
Signature: value:'TValue -> int
IsConsistent()
Signature: unit -> bool
Minimum()
Signature: unit -> KeyValuePair<'TPriority,'TValue>
MinimumUpdate(priority, value)
Signature: (priority:'TPriority * value:'TValue) -> bool
PriorityComparison
Signature: Comparison<'TPriority>
RemoveAt(index)
Signature: index:int -> KeyValuePair<'TPriority,'TValue>

Removes element at a certain index.
TODO: RemoveAt is wrong.

RemoveMinimum()
Signature: unit -> KeyValuePair<'TPriority,'TValue>
ToPriorityValueArray()
Signature: unit -> KeyValuePair<'TPriority,'TValue> []
ToString2()
Signature: unit -> string
ToStringTree()
Signature: unit -> string
ToValueArray()
Signature: unit -> 'TValue []
Update(priority, value)
Signature: (priority:'TPriority * value:'TValue) -> unit
Fork me on GitHub