Show / Hide Table of Contents

    Class FibornacciHeap<T>

    A fibornacci minMax heap implementation.

    Inheritance
    Object
    FibornacciHeap<T>
    Namespace: Advanced.Algorithms.DataStructures
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class FibornacciHeap<T> : IEnumerable<T> where T : IComparable
    Type Parameters
    Name Description
    T

    Constructors

    FibornacciHeap(SortDirection)

    Declaration
    public FibornacciHeap(SortDirection sortDirection = null)
    Parameters
    Type Name Description
    SortDirection sortDirection

    Properties

    Count

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

    Methods

    Extract()

    Time complexity: O(log(n)).

    Declaration
    public T Extract()
    Returns
    Type Description
    T

    GetEnumerator()

    Declaration
    public IEnumerator<T> GetEnumerator()
    Returns
    Type Description
    IEnumerator<T>

    Insert(T)

    Time complexity: O(1).

    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
    Type Name Description
    FibornacciHeap<T> FibornacciHeap

    Peek()

    Time complexity: O(1).

    Declaration
    public T Peek()
    Returns
    Type Description
    T

    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
    Back to top Generated by DocFX