优先级队列

1
template<class T>
2
void Enqueue(T item, int priority)
3
{
4
    heap.Add(new PriorityItem(item, priority));
5
    ShiftUp(heap, heap.length, heap.length - 1);
6
}

1
template<class T>
2
T Dequeue()
3
{
4
    if (heap.Count == 0)
5
        throw new InvalidOperationException("Queue is empty");
6

7
    T result = heap[0].Item;
8
    // 将最后一个元素移到堆顶
9
    heap[0] = heap[heap.Count - 1];
10
    heap.RemoveAt(heap.Count - 1);
11
    if (heap.Count > 0)
12
        HeapifyDown(heap, heap.length, 0);
13
    return result;
14
}