Class FibonacciHeap<T>

A fibornacci minMax heap implementation.

Inheritance
Object
FibonacciHeap<T>
Implements
Inherited Members
Namespace: Advanced.Algorithms.DataStructures
Assembly: Advanced.Algorithms.dll
Syntax
public class FibonacciHeap<T> : IEnumerable<T>, IEnumerable where T : IComparable
Type Parameters
Name Description
T

Constructors

| Improve this Doc View Source

FibonacciHeap(SortDirection)

Declaration
public FibonacciHeap(SortDirection sortDirection = SortDirection.Ascending)
Parameters
Type Name Description
SortDirection sortDirection

Properties

| Improve this Doc View Source

Count

Declaration
public int Count { get; }
Property Value
Type Description
Int32

Methods

| Improve this Doc View Source

Extract()

Time complexity: O(log(n)).

Declaration
public T Extract()
Returns
Type Description
T
| Improve this Doc View Source

GetEnumerator()

Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type Description
IEnumerator<T>
| Improve this Doc View Source

Insert(T)

Time complexity: O(1).

Declaration
public void Insert(T newItem)
Parameters
Type Name Description
T newItem
| Improve this Doc View Source

Merge(FibonacciHeap<T>)

Unions this heap with another. Time complexity: O(1).

Declaration
public void Merge(FibonacciHeap<T> fibonacciHeap)
Parameters
Type Name Description
FibonacciHeap<T> fibonacciHeap
| Improve this Doc View Source

Peek()

Time complexity: O(1).

Declaration
public T Peek()
Returns
Type Description
T
| Improve this Doc View Source

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

Explicit Interface Implementations

| Improve this Doc View Source

IEnumerable.GetEnumerator()

Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Type Description
IEnumerator

Implements