Show / Hide Table of Contents

    Class MinPriorityQueue<T>

    A priority queue implementation using min heap, assuming that lower values have a higher priority.

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

    Methods

    Dequeue()

    Time complexity:O(log(n)).

    Declaration
    public T Dequeue()
    Returns
    Type Description
    T

    Enqueue(T)

    Time complexity:O(log(n)).

    Declaration
    public void Enqueue(T item)
    Parameters
    Type Name Description
    T item

    GetEnumerator()

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

    Peek()

    Time complexity:O(1).

    Declaration
    public T Peek()
    Returns
    Type Description
    T
    Back to top Generated by DocFX