Package org.drip.graph.heap
Class PriorityQueueEntry<KEY,ITEM>
java.lang.Object
org.drip.graph.heap.PriorityQueueEntry<KEY,ITEM>
public class PriorityQueueEntry<KEY,ITEM>
extends java.lang.Object
PriorityQueueEntry holds the Key/Value Pair of a Priority Queue Entry. The References are:
- Brodal, G. S. (1996): Priority Queue on Parallel Machines Scandinavian Workshop on Algorithm Theory – SWAT ’96 416-427
- Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
- Sanders, P., K. Mehlhorn, M. Dietzfelbinger, and R. Dementiev (2019): Sequential and Parallel Algorithms and Data Structures – A Basic Toolbox Springer
- Sundell, H., and P. Tsigas (2005): Fast and Lock-free Concurrent Priority Queues for Multi-threaded Systems Journal of Parallel and Distributed Computing 65 (5) 609-627
- Wikipedia (2020): Priority Queue https://en.wikipedia.org/wiki/Priority_queue
- Module = Computational Core Module
- Library = Graph Algorithm Library
- Project = Graph Optimization and Tree Construction Algorithms
- Package = Heap Based Priority Queue Implementations
- Author:
- Lakshmi Krishnamurthy
-
Constructor Summary
Constructors Constructor Description PriorityQueueEntry(KEY key, ITEM item)
PriorityQueueEntry Constructor -
Method Summary
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Constructor Details
-
PriorityQueueEntry
PriorityQueueEntry Constructor- Parameters:
key
- Keyitem
- Item- Throws:
java.lang.Exception
- Thrown if the Inputs are Invalid
-
-
Method Details
-
key
Retrieve the Key- Returns:
- The Key
-
item
Retrieve the Item- Returns:
- The Item
-
setKey
Set the Key- Parameters:
key
- The Key- Returns:
- TRUE - The Key successfully set
-
setItem
Set the Item- Parameters:
item
- The Item- Returns:
- TRUE - The Value successfully set
-
clone
-
toString
public java.lang.String toString()- Overrides:
toString
in classjava.lang.Object
-