Package gov.nist.antd.merlin.algorithm.route.util

Interface Summary

PriorityQueue	This is the interface for PriorityQueue.
PriorityQueue.Position	The Position interface represents a type that can be used for the decreaseKey operation.

Class Summary

BinaryHeap	This class implements a binary heap.
Edge	This class is the representation of an edge in the graph
Graph	This class creates a graph from an object OpNet.
PairingHeap	This class is the representation of queue
PairingHeap.PairNode	Private static class for use with PairHeap.
Path	Represents an entry in the priority queue for algorithm.
Vertex	This class is the representation of a node in the graph

Exception Summary

GraphException	This class is used to signal violations of preconditions for various shortest path algorithms.
UnderflowException	This exception is thrown if the the method findmin is called on an empty queue.