Class Summary |
AbstractEdgeCollection |
An abstract Collection for Graph.Edges
to help implement the Graph.edges( Predicate )
method. |
AbstractGraph |
This class provides a skeletal implementation of the
Graph interface, to minimize the effort required to
implement this interface. |
AbstractIntegerNodeGraph |
An unmodifiable graph where the nodes are Integers
from zero to a specified number (exclusive) and the edges do not
contain user-defined objects. |
AbstractIntegerNodeGraph.AbstractIntegerEdgeCollection | |
AbstractIntegerNodeGraph.EdgeImpl |
Protected Graph.Edge implementation. |
AbstractNodeCollection |
An abstract Collection for nodes to help implement
the Graph.nodes( Predicate ) method.
|
AbstractOrientedForest |
This class provides a skeletal implementation of the
OrientedForest interface, to minimize the effort
required to implement this interface.
|
AbstractSingletonCollection |
A modifiable, lazy singleton Collection view. |
AbstractUnmodifiableCollection |
An extension of AbstractCollection in which all modifying
operations explicitly throw exceptions.
|
AdjacentNodeCollection |
A Collection for nodes to help implement the Graph.adjacentNodes( Predicate ) method.
|
AllPredicate |
A Predicate which returns the logical short-circuit
and of its operands.
|
AndPredicate |
A Predicate which returns the logical short-circuit
and of its operands.
|
AnyPredicate |
A Predicate which returns the logical short-circuit
or of its operands.
|
BreadthFirstTraverser |
A breadth-first Traverser for a Graph ,
with no cycle detection. |
CartesianProduct |
A Collection whose elements are all of the ordered
pairs (x, y), where x is from the first delegate collection and y
is from the second. |
ChildTraverserFactory |
A Transformer which when given a node, returns a
Traverser over the children of that
node, specified by an OrientedForest .
|
CirculantGraph |
A circulant Graph . |
ClosureChain |
A chain of Closures .
|
CollectionWrapper |
A Collection which wraps another. |
CompleteBipartiteGraph |
A complete bipartite graph.
|
CompleteGraph |
A Graph containing a set of Integer
nodes where there is an edge between every pair of nodes.
|
CompleteTree |
A Graph which is a complete tree.
|
CompositeCollection |
A Collection view of a number of other
Collections . |
ContainsPredicate |
A Predicate which tests whether an object is an
element of a Collection .
|
Cycle |
A Graph containing a set of Integer
nodes connected by a path of edges from the first node to the last
one, and then back to the first, making a cycle.
|
DefaultEdge |
A default Edge implementation
in which the user-defined object must be null . |
DefaultGraph |
A default implementation of the ObservableGraph interface.
|
DefaultIncidentEdgeGetter |
A Transformer which when given a node, returns a
single Edge incident to that node, specified by a
Graph and a Predicate .
|
DefaultObjectEdge |
A default Edge implementation.
|
DefaultOrientedForest |
A default implementation of the Graph and
OrientedForest interfaces.
|
DefaultOrientedForestView |
A default view implementation of the OrientedForest
interface.
|
DefaultRootedTreeView |
A default view implementation of the RootedTree
interface.
|
DefaultSimpleEdge |
A default Edge implementation
for a simple graph in which the user-defined object must be
null . |
DefaultTraverserFactory |
A Transformer which when given a node, returns a
Traverser over nodes adjacent to that
node, specified by a Graph and a
Predicate .
|
DepthFirstForestView |
A constructive (not lazy) depth-first tree for a
portion of a Graph .
|
DepthFirstTraverser |
A depth-first Traverser for a Graph ,
with no cycle detection. |
DepthFirstTreeView |
A constructive (not lazy) depth-first tree for a
portion of a Graph . |
EdgeIteratorTraverserAdapter |
This class wraps an Iterator over Edge
objects, presenting a Traverser. |
EdgePredicate |
A general interface for Predicates testing Graph.Edges that can be piecewise defined. |
EdgePredicateFactory |
A factory for creating EdgePredicates .
|
EmptyGraph |
A Graph containing a set of Integer
nodes and no edges.
|
EqualPredicate |
A Predicate which simply tests the evaluate( object ) argument for equality with a specified object.
|
EqualsTraverserPredicate |
A Predicate which simply tests for equality with a
specified Edge.
|
FalsePredicate |
A Predicate which always returns false .
|
FileSystemForest |
A lazy forest graph of the local file system. |
FilteredCollection |
A Collection which presents a filtered view of
another.
|
FilteredEdgeIterator |
A simple filtered edge Iterator . |
FilteredGraph |
A filtered Graph implementation. |
FilteredGraphListener |
A GraphListener which filters events to be forwarded
to an ObservableGraphDelegate. |
FilteredIterator |
A filtered Iterator . |
FilteredNodeIterator |
A simple filtered node Iterator . |
FilteredTraverser |
A simple filtered Traverser . |
ForestTreeAdapter |
An adapter which presents the subgraph of an OrientedForest rooted at a specified node as a RootedTree.
|
ForestTreeExtension |
A RootedTree which is formed by extending an OrientedForest, adding a dummy root node (and edges) which is the
parent of the forest's root nodes.
|
ForwardingGraphListener |
A GraphListener which forwards events to an ObservableGraphDelegate. |
Graph |
The root interface of the graph hierarchy.
|
GraphEvent |
An event that indicates a structural change in a Graph.
|
GraphListener |
The listener interface for receiving
GraphEvents .
|
GraphStructureIterator |
An Iterator over the nodes and edges of a
Graph ordered such that the endpoints of a
Graph.Edge are always seen before the edge
itself. |
GraphTransformer |
A Graph which wraps another, transforming its nodes
and edges in some way.
|
GraphUtils |
This class contains static final members and static methods
related to graphs and their iterators.
|
GraphView |
Implementations of this interface represent a "view" of a Graph, a particular way of looking at it. |
GraphWrapper |
A Graph which wraps another. |
Graph.Edge |
An interface describing an edge in a Graph. |
Identifier |
Basically, this is just an Object with a Identifier value set by the constructor. |
IdentityPredicate |
A Predicate which simply tests the evaluate( object ) argument for reference equality with a
specified object.
|
IncidentEdgeCollection |
A Collection for Graph.Edges to help
implement the Graph.incidentEdges(
Predicate ) method.
|
InstanceofPredicate |
A Predicate which tests the evaluate( object ) argument for being an instance of a particular
class.
|
IntegerOffsetTransformer |
An InvertibleTransformer which adds an offset to
Integers .
|
InvertibleTransformer |
An invertible Transformer .
|
IteratorChain |
A chain of Iterators . |
Join |
A Graph which is the join of two other
Graphs with disjoint node sets. |
LoggingCollection |
A Collection which wraps another to provide logging
support.
|
LoggingGraph |
A Graph which wraps another to provide logging
support.
|
LoggingIterator |
An Iterator which wraps another to provide logging
support.
|
LoggingTraverser |
A Traverser which wraps another to provide logging
support.
|
LoopGraph |
A loop Graph .
|
NoSuchNodeException |
Thrown by a Graph method when an argument node is not
found in the Graph , but the method cannot provide a
meaningful result or perform its function without one.
|
NotPredicate |
A Predicate which returns the logical converse of its
operand.
|
ObservableGraph |
A Graph which can be listened to for structural
changes.
|
ObservableGraphDelegate |
A helper class providing functionality to help implement ObservableGraph.
|
ObservableGraphWrapper |
A wrapper around a Graph so that it can be watched for
structural changes. |
OrderedPair |
A simple mutable ordered pair implementation. |
OrientedForest |
A data structure with parent/child relationships. |
OrPredicate |
A Predicate which returns the logical short-circuit
or of its operands.
|
ParentEdgeGetter |
A Transformer which when given a node, returns the
parent Edge of that node, specified by an
OrientedForest .
|
Path |
A Graph containing a set of Integer
nodes connected by a path of edges from the first node to the last
one.
|
PetersenGraph |
A Petersen Graph.
|
PlanarMesh |
An m x n planar mesh.
|
PostOrderTraverser |
A post-order depth-first Traverser for a
Graph , with no cycle detection. |
PredicateUtils |
This class contains static members related to
Predicates .
|
PreOrderTraverser |
A pre-order depth-first Traverser for a
Graph , with no cycle detection. |
Prism |
An m x n prism, where m is the size of
the cycle and n is the size of the path. |
Product |
A Graph which is the product of two other
Graphs . |
PruningTraverser |
A Traverser which allows its traversal to be modified
by pruning.
|
RandomGraphFactory |
This class contains static factory methods for creating random
graphs.
|
Reapable |
Something which can be reaped; see Reaper for more
information.
|
ReapableCollection |
A reapable Collection . |
Reaper |
The interface defining an object which reaps
Reapables . |
Rooted |
A graph structure which distinguishes a particular node as the
"root".
|
RootedTree |
An OrientedForest which is restricted to the descendants
of a single root node.
|
RunnableReaper |
A Runnable which reaps Reapables .
|
SimpleStack |
A simple stack data structure, basically a convenience extension
of ArrayList .
|
SingletonEdgeCollection |
A singleton edge Collection view. |
SingletonEdgeIterator |
An Iterator over a single Edge . SingletonEdgeIterator delegates to Graph.removeEdge(
edge ) .
|
SingletonGraph |
An unmodifiable Graph which contains a single node
and no edges.
|
SingletonNodeCollection |
A singleton node Collection view. |
SingletonTraverser |
A Traverser over a single Edge . SingletonTraverser and SingletonTraverser delegate to Graph.removeNode( node ) and Graph.removeEdge( edge ) respectively.
|
Star |
A star graph with one central node and n outer nodes.
|
SynchronizedCollection |
A synchronized view of another Collection .
|
SynchronizedGraph |
A synchronized view of a Graph . |
TopologicalSortTraverser |
A Traverser which returns nodes in a topologically
sorted order.
|
ToroidalMesh |
An m x n toroidal mesh.
|
TransformerChain |
A chain of Transformers .
|
TransformingGraphListener |
A GraphListener which transforms nodes and edges
before forwarding them to an ObservableGraphDelegate.
|
Traverser |
An interface for traversing through nodes in a Graph. |
TraverserAdjacentNodeIteratorAdapter |
This class wraps a Traverser, presenting an
Iterator over adjacent nodes. |
TraverserChain |
A chain of Traversers .
|
TraverserEdgeIteratorAdapter |
This class wraps a Traverser, presenting an
Iterator over the accessed Edges .
|
TraverserNodeIteratorAdapter |
This class wraps a Traverser, presenting an
Iterator over the accessed nodes. |
TraverserPredicate |
A general interface for Predicates for traversals
that can be piecewise defined. |
TraverserPredicateFactory |
A factory for creating
TraverserPredicates .
|
TrivialOrientedForestView |
A trivial OrientedForest view of a Graph, where
there is no forest structure. |
TruePredicate |
A Predicate which always returns true .
|
UnmodifiableGraph |
An unmodifiable view of a Graph . |
UnmodifiableIterator |
An unmodifiable view of an Iterator .
|
UnmodifiableTraverser |
An unmodifiable view of a Traverser .
|
UnorderedPair |
A simple mutable unordered pair implementation. |
Walker |
A Traverser which walks a graph, with no cycle
detection. |
Weight |
A weight function, which may be applied to
Edges .
|
Wheel |
A wheel graph with one central node and n outer
nodes.
|