基于堆的优先队列的实现

优先队列的异常处理类

view plaincopy to clipboardprint?

1. #ifndef PQUEUEEXCEPTION_H_
2. #define PQUEUEEXCEPTION_H_
3. #include<stdexcept>
4. #include<string>
5. class PQueueException :public std::logic_error 
6. { 
7. public: 
8.         PQueueException(const std::string &message="") 
9.             :std::logic_error(message.c_str()) 
10.         {} 
11. }; 
12. #endif

#ifndef PQUEUEEXCEPTION_H_ #define PQUEUEEXCEPTION_H_ #include<stdexcept> #include<string> class PQueueException :public std::logic_error { public: PQueueException(const std::string &message="") :std::logic_error(message.c_str()) {} }; #endif

优先队列类的头文件

view plaincopy to clipboardprint?

1. #ifndef PRIORITYQUEUE_H_
2. #define PRIORITYQUEUE_H_
3. #include"heap_array.h"
4. #include"PQueueexception.h"
5. typedef HeapItemType PQueueItemType; 
6. class PriorityQueue 
7. { 
8. public: 
9.         PriorityQueue(); 
10. //default constructor ,copy constructor and 
11. //destrutor are supplied by the complier
12.  
13. //priority-queue operations:
14. virtual bool pqempty()const; 
15. virtual void pqInsert(const PQueueItemType &newitem) 
16. throw(PQueueException); 
17. virtual void pqDelete(PQueueItemType &rootitem) 
18. throw(PQueueException); 
19. private: 
20.         Heap h; 
21. }; 
22. #endif

#ifndef PRIORITYQUEUE_H_ #define PRIORITYQUEUE_H_ #include"heap_array.h" #include"PQueueexception.h" typedef HeapItemType PQueueItemType; class PriorityQueue { public: PriorityQueue(); //default constructor ,copy constructor and //destrutor are supplied by the complier //priority-queue operations: virtual bool pqempty()const; virtual void pqInsert(const PQueueItemType &newitem) throw(PQueueException); virtual void pqDelete(PQueueItemType &rootitem) throw(PQueueException); private: Heap h; }; #endif

优先队列的实现文件

view plaincopy to clipboardprint?

1. #include"priorityQueue.h"
2. PriorityQueue::PriorityQueue() 
3.     :h() 
4. {} 
5. bool PriorityQueue::pqempty()const
6. { 
7. return h.empty(); 
8. } 
9. void PriorityQueue::pqInsert(const PQueueItemType &newitem) 
10. throw(PQueueException) 
11. { 
12. try{ 
13.         h.heapInsert(newitem); 
14.     } 
15. catch(HeapException &e) 
16.     { 
17. throw PQueueException("PQueueException : insert item failed !"); 
18.     } 
19. } 
20. void PriorityQueue::pqDelete(PQueueItemType &rootitem) 
21. throw(PQueueException) 
22. { 
23. try{ 
24.         h.heapDelete(rootitem); 
25.     }catch(PQueueException &e) 
26.     { 
27. throw PQueueException("PQueueException :delete item failed !"); 
28.     } 
29. } 

#include"priorityQueue.h" PriorityQueue::PriorityQueue() :h() {} bool PriorityQueue::pqempty()const { return h.empty(); } void PriorityQueue::pqInsert(const PQueueItemType &newitem) throw(PQueueException) { try{ h.heapInsert(newitem); } catch(HeapException &e) { throw PQueueException("PQueueException : insert item failed !"); } } void PriorityQueue::pqDelete(PQueueItemType &rootitem) throw(PQueueException) { try{ h.heapDelete(rootitem); }catch(PQueueException &e) { throw PQueueException("PQueueException :delete item failed !"); } }

测试优先队列

view plaincopy to clipboardprint?

1. #include<iostream>
2. #include"priorityQueue.h"
3. using namespace std; 
4. int main() 
5. { 
6.     PriorityQueue apq; 
7.  
8. try{ 
9.     apq.pqInsert(KeyItem("sort")); 
10.     apq.pqInsert(KeyItem("exception")); 
11.     apq.pqInsert(KeyItem("STL")); 
12.     apq.pqInsert(KeyItem("queue")); 
13.     apq.pqInsert(KeyItem("priority")); 
14.     apq.pqInsert(KeyItem("heap")); 
15.     apq.pqInsert(KeyItem("item")); 
16.     apq.pqInsert(KeyItem("terrda")); 
17.     apq.pqInsert(KeyItem("absort")); 
18.     apq.heapInsert(KeyItem("oppo")); 
19. //  aheap.display();
20.     KeyItem item; 
21.     cout<&lt;"the priority queue is :"&lt;&lt;endl; 
22. while(!apq.empty()) 
23.     { 
24.         apq.pqDelete(item); 
25.         cout&lt;&lt;item.getKey()&lt;&lt;endl; 
26.     } 
27.     }catch(PQueueException &e) 
28.     { 
29.         cout&lt;&lt;e.what()&lt;&lt;endl; 
30.     } 
31. return 0; 
32. } 

#include&lt;iostream> #include"priorityQueue.h" using namespace std; int main() { PriorityQueue apq; try{ apq.pqInsert(KeyItem("sort")); apq.pqInsert(KeyItem("exception")); apq.pqInsert(KeyItem("STL")); apq.pqInsert(KeyItem("queue")); apq.pqInsert(KeyItem("priority")); apq.pqInsert(KeyItem("heap")); apq.pqInsert(KeyItem("item")); apq.pqInsert(KeyItem("terrda")); apq.pqInsert(KeyItem("absort")); apq.heapInsert(KeyItem("oppo")); // aheap.display(); KeyItem item; cout&lt;&lt;"the priority queue is :"&lt;&lt;endl; while(!apq.empty()) { apq.pqDelete(item); cout&lt;&lt;item.getKey()&lt;&lt;endl; } }catch(PQueueException &e) { cout&lt;&lt;e.what()&lt;&lt;endl; } return 0; }