Package byucc.jhdl.synth.graph

Interface Summary

GenericIterator	An object that implements the GenericIterator interface guarantees sequential access to a series of elements, in both forward and backward direction.
IndexedIterator	IndexedIterator extends GenericIterator and adds the ability to access items in the series with numeric indexes, (indices?).
IndexedVertexIterator	IndexedVertexIterator is an interface that has all the functionality of IndexedIterator as well as VertexIterator.
Nameable	This interface is used to provide names for Vertices/Graphs/etc.
SourceGraph
SubsetSelector	An interface for separating Objects into two classes, those that belong to a particular subset and those that do not.
VertexIterator	An interface that allows iteration of Vertex objects.

Class Summary

DAG	A directed Acyclic Graph (DAG).
Edge	Represents a directed edge in a graph.
EdgeIterator	A class to allow a GenericIterator for Edge objects in an EdgeVector.
EdgeVector	A simple class to hold a collection of Edges.
EnumerationIterator	An object to allow the IndexedIterator methods to be used on an Enumeration.
Graph	Basic object for representing graphs.
HashtableElementsIterator	An object to allow using the IndexedIterator methods on all elements in a Hashtable.
HashtableKeysIterator	An object to allow using the IndexedIterator methods on all keys in a Hashtable.
NamedObject	An abstract class for an object which can have a name
SubsetIterator	A class that supports iteration over a subset of elements in another iterator.
VectorIterator	A simple object that contains a vector and implements the IndexedIterator interface for the objects in that vector.
Vertex	Represents a vertex in a graph.
VertexVector	A simple class to hold a collection of Vertex.
VertexVectorIterator	A class to allow a GenericIterator for Vertex objects in a VertexVector.

Exception Summary

AmbiguousGetException	An exception that is thrown if a method cannot retrieve the desired data due to an ambiguity.
CyclicGraphException	An exception that is thrown if any DAG method determines that the graph contains cycles.