Implement a priority queue class based on the max-heap class implementation of Figure 5.19. 

The following methods should be supported for manipulating the priority queue:

void enqueue(int ObjectID, int priority);

int dequeue();

void changeweight(int ObjectID, int newPriority);

Method enqueue inserts a new object into the priority queue with ID number ObjectID and priority priority. Method dequeue removes the object with highest priority from the priority queue and returns its object ID.

Method changeweight changes the priority of the object with ID number ObjectID to be newPriority. The type for Elem should be a class that stores the object ID and the priority for that object. You will need a mechanism for finding the position of the desired object within the heap. Use an array, storing the object with ObjectID i in position i. (Be sure in your testing to keep the ObjectIDs within the array bounds.) You must also modify the heap implementation to store the object’s position in the auxiliary array so that updates to objects in the heap can be updated as well in the array.

Transcribed Image Text:

import java.lang. Comparable; /** Max-heap implementation */ public class MaxHeap