Class PairingMinHeap<T>
A pairing min heap implementation.
Inheritance
PairingMinHeap<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class PairingMinHeap<T> : IEnumerable<T>, IEnumerable where T : IComparable
Type Parameters
Properties
Count
Declaration
public int Count { get; }
Property Value
Methods
DecrementKey(T, T)
Time complexity: O(log(n)).
Declaration
public void DecrementKey(T currentValue, T newValue)
Parameters
Type |
Name |
Description |
T |
currentValue |
|
T |
newValue |
|
Time complexity: O(log(n)).
Declaration
Returns
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
Insert(T)
Insert a new Node.
Time complexity: O(1).
Declaration
public void Insert(T newItem)
Parameters
Type |
Name |
Description |
T |
newItem |
|
Merge(PairingMinHeap<T>)
Merge another heap with this heap.
Time complexity: O(1).
Declaration
public void Merge(PairingMinHeap<T> PairingHeap)
Parameters
PeekMin()
Declaration
Returns
Explicit Interface Implementations
IEnumerable.GetEnumerator()
Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Implements