Java Priority Queue?

First, create a comparator for the priority queue: class MinHeapComparator implements Comparator { @Override public int compare(Integer one, Integer two) { return mDistancesone - mDistancestwo;//... } } This is from a shortest path algorithm I wrote. MDistances is the distances from source to a vertex. You can modify the comparator to compare how you like From the documentation for Comparator: "Compares its two arguments for order.

Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second Complete documentation here: http://download.oracle.com/javase/1.5.0/docs/api/java/util/Comparator.html Second, add items to the priority queue. I usually build a graph with an array containing vertex objects, each object containing a list of its adjacent vertices. So in my case I just add indices to the priority queue to represent vertices.

The comparator can then contain logic to do whatever with the vertices. PriorityQueue.add() adds items Third, instantiate the priority queue with the comparator: PriorityQueue minHeap = new PriorityQueue(numberItems, new MinHeapComparator()) Fourth, call PriorityQueue.poll() to extract the top item on the heap. Your comparator is used to determine what item is on the top of the heap.

First, create a comparator for the priority queue: class MinHeapComparator implements Comparator { @Override public int compare(Integer one, Integer two) { return mDistancesone - mDistancestwo;//... } } This is from a shortest path algorithm I wrote. MDistances is the distances from source to a vertex. You can modify the comparator to compare how you like.

From the documentation for Comparator: "Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second. " Complete documentation here: http://download.oracle.com/javase/1.5.0/docs/api/java/util/Comparator.html Second, add items to the priority queue.

I usually build a graph with an array containing vertex objects, each object containing a list of its adjacent vertices. So in my case I just add indices to the priority queue to represent vertices. The comparator can then contain logic to do whatever with the vertices.PriorityQueue.add() adds items.

Third, instantiate the priority queue with the comparator: PriorityQueue minHeap = new PriorityQueue(numberItems, new MinHeapComparator()); Fourth, call PriorityQueue.poll() to extract the top item on the heap. Your comparator is used to determine what item is on the top of the heap.

Thanks. Also could you add the items to the priority queue, and then run a for loop that compares them and removes the min-edge? – kachilous Apr 12 at 2:19 If you setup the comparator to compare edge weights, calling the poll() method in a loop will remove the minimum edge at each iteration.

What algorithm are you implementing? Minimum spanning tree in the graph? – Ryan Reeves Apr 12 at 3:10 yes I have to ultimately find the mst, also I have to use a disjoint set data structure – kachilous Apr 12 at 4:12.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.