Uses of Class
org.drip.graph.heap.PriorityQueue

Packages that use PriorityQueue

Package	Description
org.drip.graph.core	Vertexes, Edges, Trees, and Graphs
org.drip.graph.heap	Heap Based Priority Queue Implementations
org.drip.graph.softheap	Soft Heap - Approximate Priority Queue

Uses of PriorityQueue in org.drip.graph.core

Methods in org.drip.graph.core that return PriorityQueue

Modifier and Type	Method	Description
PriorityQueue<java.lang.Double,Edge>	Vertex.adjacencyPriorityQueue(boolean minHeap)	Retrieve the Ordered Adjacency Priority Queue
PriorityQueue<java.lang.Double,java.lang.String>	Network.edgePriorityQueue(boolean minHeap)	Construct an Edge Priority Queue
PriorityQueue<java.lang.Double,Edge>	Tree.edgePriorityQueue(Network<?> network, boolean minHeap)	Construct and Retrieve the Edge Priority Queue from the Graph

Uses of PriorityQueue in org.drip.graph.heap

Subclasses of PriorityQueue in org.drip.graph.heap

Modifier and Type	Class	Description
class	BinaryTreePriorityQueue<KEY extends java.lang.Comparable<KEY>,ITEM>	BinaryTreePriorityQueue implements a Binary Heap Based off of a Binary Tree.
class	BinomialTreePriorityQueue<KEY extends java.lang.Comparable<KEY>,ITEM>	BinomialTreePriorityQueue implements an Binomial Tree Based Priority Queue.

Methods in org.drip.graph.heap that return PriorityQueue

Modifier and Type	Method	Description
PriorityQueue<java.lang.Long,ITEM>	TimedCollection.priorityQueue()	Retrieve the Underlying Priority Queue

Methods in org.drip.graph.heap with parameters of type PriorityQueue

Modifier and Type	Method	Description
boolean	BinaryTreePriorityQueue.meld(PriorityQueue<KEY,ITEM> priorityQueueOther)
boolean	BinomialTreePriorityQueue.meld(PriorityQueue<KEY,ITEM> priorityQueueOther)
abstract boolean	PriorityQueue.meld(PriorityQueue<KEY,ITEM> priorityQueueOther)	Meld the Specified Priority Queue with the Current

Constructors in org.drip.graph.heap with parameters of type PriorityQueue

Constructor	Description
TimedCollection(PriorityQueue<java.lang.Long,ITEM> priorityQueue)	TimedCollection Constructor

Uses of PriorityQueue in org.drip.graph.softheap

Subclasses of PriorityQueue in org.drip.graph.softheap

Modifier and Type	Class	Description
class	ApproximatePriorityQueue<KEY extends java.lang.Comparable<KEY>,ITEM>	ApproximatePriorityQueue exposes the Functions Approximate Priority Queue with Optimal Error Rate.
class	KaplanZwickPriorityQueue<KEY extends java.lang.Comparable<KEY>,ITEM>	KaplanZwickPriorityQueue implements the Soft Heap described in Kaplan and Zwick (2009).

Methods in org.drip.graph.softheap with parameters of type PriorityQueue

Modifier and Type	Method	Description
boolean	KaplanZwickPriorityQueue.meld(PriorityQueue<KEY,ITEM> priorityQueueOther)