优先级队列 c++编程.doc

#includeusing namespace std;struct Nodeint Priority;double num;Node *next;class PQueueprivate:int Maxsize;Node *head;int count;public:PQueue()head=NULL;Maxsize=50;count=0;PQueue()while(head!=NULL)Node *p=head;head=head-next;delete p;count=0;void Create(int n)for(int i=0;in;i+)Node *p=new Node;cout请输入第i+1个元素:p-num;cout请输入第i+1个元素的优先权：p-Priority;if(head=NULL)head=p;p-next=NULL;elseNode *q=head;while(q-next!=NULL)q=q-next;q-next=p;p-next=NULL;q=p;count+;void sort()if(head=NULL|head-next=NULL)cout错误！队列只有一个或没有结点.next!=NULL;p1=p1-next)Node *p_min=p1;for(Node *p2=p1-next;p2!=NULL;p2=p2-next)if(p2-PriorityPriority)p_min=p2;if(p_min!=p1)double temp1=p1-num;p1-num=p_min-num;p_min-num=temp1;int temp2=p1-Priority;p1-Priority=p_min-Priority;p_min-Priority=temp2;bool Insert(double x,int y)Node *p=new Node;p-num=x;p-Priority=y;Node *q=head;while(q-next!=NULL)q=q-next;q-next=p;p-next=NULL;return true;bool Remove()if(head=NULL)coutnext;delete p;count-;return true;void makeEmpty()while(head!=NULL)Node *p=head;head=head-next;delete p;bool IsEmpty()constreturn(count=0)?true:false;bool IsFull()constreturn(count=Maxsize)?true:false;int getSize()constreturn count;void output()for(Node *p=head;p!=NULL;p=p-next)cout元素值为：numendl;cout元素优先权为：Priorityendl;coutendl;int main()PQueue A;A.Create(5);A.sor