Class MinPriorityQueue<T>
A priority queue implementation using min heap,
assuming that lower values have a higher priority.
Inheritance
MinPriorityQueue<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class MinPriorityQueue<T> : IEnumerable<T>, IEnumerable where T : IComparable
Type Parameters
Methods
Dequeue()
Time complexity:O(log(n)).
Declaration
Returns
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
Peek()
Declaration
Returns
Explicit Interface Implementations
IEnumerable.GetEnumerator()
Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Implements