priorityqueue « LinkedList « Java Collection Q&A

1. Java - PriorityQueue vs sorted LinkedList    stackoverflow.com

Which implementation is less "heavy": PriorityQueue or a sorted LinkedList (using a Comparator)? I want to have all the items sorted. The insertion will be very frequent and ocasionally I will have ...

2. I need some help clearing up a problem with sorting a Priority Queue+linked list in Java    stackoverflow.com

Hello I am trying to implement a Priority Queue in Java from scratch with a linked list but I am having a problem sorting elements on insertion. Here is my program thus ...

3. Changing a LinkedList into a Priority Queue    stackoverflow.com

I currently have a class that has 3 linkedlists of strings or ints that I use as a stack via a trio of addFirst and removeFirst commands. (Class reproduced below) I want ...

4. How to compare generic nodes in a linked list using Comparable?    stackoverflow.com

I am implementing a sorted list using linked lists. My node class looks like this

public class Node<E>{
    E elem;
    Node<E> next, previous;
}

5. priority queue based on unsorted list(Java's LinkedList Class)    coderanch.com

Hello all, I am having a really hard time thinking my way through implementing a priority queue using Java's LinkedList class. I understand the priority queue in general terms. Basically you insert key-value pairs into the PQ in any order; but remove entries(key-value pairs) based on highest priority- in my case lowest key. That is a simple concept but implementing it, ...

6. Priority Queue as a LinkedList    forums.oracle.com

I have to implement a PriorityQueue using a LinkedList maintaining that list in descending order. So basically, I just need to define the enqueue to place the months in sorted order correct? The only output is needed are the first 3 letters of the months, however I noticed I made a mistake in the code. The file read in is in ...

7. Help using LinkedList and PriorityQueue...    forums.oracle.com

I'm having a problem that I simply don't know the answer to. Here's the code: PriorityQueue solutionSet = new PriorityQueue(); LinkedList path = new LinkedList(); LinkedList tempPath; ... if(blankX < 2) { tempPath = new LinkedList(path); tempPath.add(1); solutionSet.offer(tempPath); tempPath.removeLast(); } if(blankX > 0) { tempPath = new LinkedList(path); tempPath.add(3); solutionSet.offer(tempPath); tempPath.removeLast(); } What I'm trying to do is make tempPath a ...