优先权队列的实现

数据结构中的优先权队列

 

#include<iostream.h>


enum ResultCode{NOMemory,OutOfBounds,Underflow,Overflow,Duplicate};
template<class T>
class PrioQueue
{
	public:
		PrioQueue(int mSize=20);
		~PrioQueue(){delete[] q;}
		bool IsEmpty() const{return n==0;}
		bool IsFull() const{return n==maxSize;}
		void Append(const T &x);
		void Serve(T &x);
		void Output();
	private:
		void AdjustDown(int r,int j);
		void AdjustUp(int j);
		T *q;
		int n,maxSize;
};

template<class T>
PrioQueue<T>::PrioQueue(int mSize)
{
	maxSize=mSize;
	n=0;
	q=new T[maxSize];
}


template<class T>
void PrioQueue<T>::Append(const T &x)
{
	if(IsFull()) throw Overflow;
	q[n++]=x;
	AdjustUp(n-1);
}

template<class T>
void PrioQueue<T>::Serve(T &x)
{
	if(IsEmpty()) throw Underflow;
	x=q[0];
	q[0]=q[--n];
	AdjustDown(0,n-1);
}


template<class T>
void PrioQueue<T>::AdjustDown(int i,int j)
{
	int child=2*i+1;
	T temp=q[i];
	
	while(child<=j)
	{
		if((child<j)&&(q[child]>q[child+1]))
			child++;
		if(temp<=q[child])
			break;
		q[(child-1)/2]=q[child];
		child=2*child+1;
	}
	q[(child-1)/2]=temp;
}

template<class T>
void PrioQueue<T>::AdjustUp(int j)
{
	int i=j;
	T temp=q[i];
	while(i>0&&temp<q[(i-1)/2])
	{
		q[i]=q[(i-1)/2];
		i=(i-1)/2;
	}

	q[i]=temp;
}

template<class T>
void PrioQueue<T>::Output()
{
	for(int i=0;i<n;i++)
	{
		cout<<q[i]<<" ";
	}
}

 

测试代码

#include "prioQueue.h"
void main()
{

	try{
		PrioQueue<int> pq;
		int x[5];
		for(int i=0;i<5;i++)
		{
			cin>>x[i];
			pq.Append(x[i]);
		}
		
		pq.Output();
		pq.Serve(x[0]);
		pq.Output();	

	}
	catch(ResultCode err)
	{
		switch(err)
		{
		case Overflow:cout<<"Overflow"<<endl;
		case Underflow:cout<<"Underflow"<<endl;
		}
	}
}