Show / Hide Table of Contents

    Class MaxPriorityQueue<T>

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

    Inheritance
    Object
    MaxPriorityQueue<T>
    Implements
    IEnumerable<T>
    IEnumerable
    Inherited Members
    Object.ToString()
    Object.Equals(Object)
    Object.Equals(Object, Object)
    Object.ReferenceEquals(Object, Object)
    Object.GetHashCode()
    Object.GetType()
    Object.MemberwiseClone()
    Namespace: Advanced.Algorithms.DataStructures
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class MaxPriorityQueue<T> : IEnumerable<T>, IEnumerable 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

    Explicit Interface Implementations

    IEnumerable.GetEnumerator()

    Declaration
    IEnumerator IEnumerable.GetEnumerator()
    Returns
    Type Description
    IEnumerator

    Implements

    System.Collections.Generic.IEnumerable<T>
    System.Collections.IEnumerable
    Back to top Generated by DocFX