Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- // *********************************************************
- // Implementation file PQ.cpp for the ADT priority queue.
- // A heap represents the priority queue.
- // *********************************************************
- #include "PQ.h" // header file for priority queue
- bool pqClass::PQueueIsEmpty() const
- {
- return H.HeapIsEmpty();
- } // end PQueueIsEmpty
- void pqClass::PQueueInsert(const pqItemType& NewItem,
- bool& Success)
- {
- H.HeapInsert(NewItem, Success);
- } // end PQueueInsert
- void pqClass::PQueueDelete(pqItemType& PriorityItem,
- bool& Success)
- {
- H.HeapDelete(PriorityItem, Success);
- } // end PQueueDelete
- // End of implementation file.
Advertisement
Add Comment
Please, Sign In to add comment