Granikos.SMTPSimulator.Service/PriorityQueue/HeapPriorityQueue.cs
/// <summary>
///     Removes the head of the queue (node with highest priority; ties are broken by order of insertion), and returns it.
///     O(log n)
/// </summary>
Removes the head of the queue (node with highest priority; ties are broken by order of insertion), and returns it.
Removes the head of the queue ( node with highest priority ; ties are broken by order of insertion ) and returns it .
public T Dequeue()
        {
            var returnMe = _nodes[1];
            Remove(returnMe);
            return returnMe;
        }
public T Dequeue ( ) { var returnMe = _nodes [ 1 ] ; Remove ( returnMe ) ; return returnMe ; }
Removes the head of the queue (node with highest priority; ties are broken by order of insertion), and returns it.
Removes the head of the queue ( node with highest priority ; ties are broken by order of insertion ) and returns it .