Priority Queue

Priority Queue

1. Principle

   • Set key as priority for high or low
   • Insert based on the key priority
   • Remove based on the priority key value at the front of queue
   • First out on priority key value

2. Add Method

   • int index; PQElement elem = new PQElement(priorkey,item);
   • if (index > size()) thePQueue.add(elem); else thePQueue.add(index, elem);

3. Remove

   • public Object dequeue() { return thePQueue.remove(0); }

4. FindElement

5. Size

   • return PQueue.size();

6. isEmpty

   • return PQueue.isEmpty();