Class FibornacciHeap<T>
A fibornacci minMax heap implementation.
Inheritance
FibornacciHeap<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class FibornacciHeap<T> : IEnumerable<T> where T : IComparable
Type Parameters
Constructors
FibornacciHeap(SortDirection)
Declaration
public FibornacciHeap(SortDirection sortDirection = null)
Parameters
Type |
Name |
Description |
SortDirection |
sortDirection |
|
Properties
Count
Declaration
public int Count { get; }
Property Value
Methods
Time complexity: O(log(n)).
Declaration
Returns
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type |
Description |
IEnumerator<T> |
|
Insert(T)
Declaration
public void Insert(T newItem)
Parameters
Type |
Name |
Description |
T |
newItem |
|
Merge(FibornacciHeap<T>)
Unions this heap with another.
Time complexity: O(1).
Declaration
public void Merge(FibornacciHeap<T> FibornacciHeap)
Parameters
Peek()
Declaration
Returns
UpdateKey(T, T)
Update the Heap with new value for this node pointer.
Time complexity: O(1).
Declaration
public void UpdateKey(T currentValue, T newValue)
Parameters
Type |
Name |
Description |
T |
currentValue |
|
T |
newValue |
|