Remove Node From Priority Queue With Lowest Key

Question

I have a priority queue set up as the following:

PriorityQueue<Node> pq = new PriorityQueue<Node>(100);

my instructions say that the key for the priority queue will be total = cost + tax. I have getCost() and getTax() methods but I dont know if they are needed here.

I am trying to remove the Node with the lowest key value. I am not sure if I need to specify the key when initializing the priority queue, or if doing

pq.remove()

will automatically remove the one with the lowest key.

@ChiefTwoPencils Okay so remove() removes the head of the queue. But is the head the one with the lowest key value? — user11110481
– user11110481, Commented Feb 24, 2019 at 21:06

Josh · Accepted Answer · 2019-02-24 21:06:19Z

1

A PriorityQueue needs to be populated with Comparable elements, or else be supplied with a Comparator when constructed. So your Node needs to be comparable based on the total = cost + tax. If you do that correctly, the queue will put the smallest element at the top.

answered Feb 24, 2019 at 21:06

Josh

5003 silver badges6 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Remove Node From Priority Queue With Lowest Key

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related