优先队列 PriorityQueue （用堆实现的）

普通队列是一种先进先出的数据结构。数据元素附加在队尾，从队首删除。在优先队列中，每个元素都赋予一个优先级。高优先级的元素优先访问删除。例如，医院按病人的优先级分配急救室；具有最高优先级的病人先被安排进入急救室。

程序清单 PriorityQueue.h

<div style="text-align: left;"><span style="font-family: 'Microsoft YaHei'; text-align: center; background-color: rgb(255, 255, 255);"></span></div>#ifndef PRIORITYQUEUE_H_INCLUDED
#define PRIORITYQUEUE_H_INCLUDED
#include "Heap.h"


template<typename T>
class PriorityQueue{
public:
    PriorityQueue();
    void enqueue(T element) ;
    T dequeue() throw (runtime_error);
    int getSize();
private:
    Heap<T> heap;
};


template<typename T>
PriorityQueue<T>::PriorityQueue(){
}


template<typename T>
void PriorityQueue<T>::enqueue(T element){
    heap.add(element);
}


template<typename T>
T PriorityQueue<T>::dequeue() throw (runtime_error){
    return heap.remove();
}


template<typename T>
int PriorityQueue<T>::getSize(){
    return heap.getSize();
}


#endif // PRIORITYQUEUE_H_INCLUDED<u>
</u>

程序清单 TestPriorityQueue.cpp

#include<iostream>
#include "PriorityQueue.h"
using namespace std;

class Patient{
public:
    Patient(string name, int priority){
        this->name = name;
        this->priority = priority;
    }

    bool operator<(Patient &secondPatient){           //运算符重载
        return (this->priority < secondPatient.priority);
    }

    bool operator>(Patient &secondPatient){         //运算符重载

        return (this->priority > secondPatient.priority);
    }
    string getName(){
        return name;
    }
    int getPriority(){
        return priority;
    }

private:
    string name;
    int priority;
};

int main(){
    //Queue of patients
    PriorityQueue<Patient> patientQueue;
    patientQueue.enqueue(Patient("John", 2));
    patientQueue.enqueue(Patient("Jim", 1));
    patientQueue.enqueue(Patient("Tim", 5));
    patientQueue.enqueue(Patient("Cindy", 7));

    while(patientQueue.getSize() > 0){
        Patient element = patientQueue.dequeue();
        cout<<element.getName()<<" (priority: "<<element.getPriority()<<")"<<endl;
    }
}<u>
</u>