test.cpp

用堆实现优先队列

#include<iostream.h>
#include"priority_heap.h"

main()
{
	priorityheap<ObjectElem,Compare>heaparray(0,0,200);
    while(1){
		cout<<"\n请选择操作：\n"
            <<"1.初始化\n"
	        <<"2.入队\n"
	        <<"3.出队\n"
	        <<"4.改变优先级\n"
	        <<"5.输出\n"
	        <<"0.退出\n"
	        <<"\n选择:";
	  
      int choice;
      cin>>choice;
      switch(choice)
	  {case 0:return 0;
	          break;  
       case 1:heaparray.init();
		     break;      
       case 2:cout<<"输入ID:";         
		     int objectID;                   
			 cin>>objectID;
			 cout<<"输入优先级:";
			 int Priority;                   
			 cin>>Priority;
			 heaparray.enqueue(objectID,Priority);  //enqueue
			 break;
      case 3:cout<<heaparray.dequeue()<<"\n";       //dequeue
			 cout<<"出队操作成功";
			 break;
	  case 4:cout<<"输入需要改变优先级的ID:";
			 int ObjectID;cin>>ObjectID;
			 cout<<"新优先级:";
			 int newPriority;cin>>newPriority;
			 heaparray.changeweight(ObjectID,newPriority);
			 break;                                //changeweight
	  case 5:cout<<"\n输出:\n";       
		     heaparray.print();
			 break;
	  default:
		     cout<<"\n 输入错误!\n";
             break;
	   }
	}
   return 0;
}