|
Plexus v0.13.1 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
Collection for Graph.Edges
to help implement the Graph.edges( Predicate )
method.AbstractEdgeCollection.
Graph interface, to minimize the effort required to
implement this interface.Integers
from zero to a specified number (exclusive) and the edges do not
contain user-defined objects.AbstractIntegerNodeGraph.
Graph.Edge implementation.Collection for nodes to help implement
the Graph.nodes( Predicate ) method.AbstractNodeCollection.
OrientedForest interface, to minimize the effort
required to implement this interface.AbstractOrientedForest.
Collection view.AbstractSingletonCollection.
AbstractCollection in which all modifying
operations explicitly throw exceptions.UnsupportedOperationException.
Reference created by the Reaper used to construct this collection.
source to
destination.
UnsupportedOperationException.
Reference created by the Reaper used to
construct this collection.
UnsupportedOperationException.
UnsupportedOperationException.
UnsupportedOperationException.
UnsupportedOperationException.
UnsupportedOperationException.
Graph.Edge with additional information
provided by the edgeState argument, which is
given to the createEdge() method.
Graph (optional
operation).
UnsupportedOperationException.
UnsupportedOperationException.
GraphListener which will be
notified whenever this ObservableGraph's
structure changes.
GraphListener which will be
notified whenever this ObservableGraph's
structure changes.
GraphListener which will be
notified whenever this ObservableGraph's
structure changes.
GraphListener which will be
notified whenever this ObservableGraph's
structure changes.
GraphListener.
UnsupportedOperationException.
node to this Graph (optional
operation).
UnsupportedOperationException.
UnsupportedOperationException.
Collection for nodes to help implement the Graph.adjacentNodes( Predicate ) method.AdjacentNodeCollection.
AdjacentNodeCollection.
Collection.
node
for which the specified Predicate is satisfied.
Predicate which returns the logical short-circuit
and of its operands.AllPredicate.
AllPredicate.
Predicate which is
true if all of its operand predicates are
true.
Predicate which is
true if all of its operand predicates are
true.
Predicate which returns the logical short-circuit
and of its operands.AndPredicate.
Predicate which is the logical
and of the specified Predicates.
Predicate which returns the logical short-circuit
or of its operands.AnyPredicate.
AnyPredicate.
Predicate which is
true if any of its operand predicates are
true.
Predicate which is
true if any of its operand predicates are
true.
Traverser for a Graph,
with no cycle detection.BreadthFirstTraverser.
BreadthFirstTraverser, which
breadth-first traverses the descendants of the specified
startNode.
BreadthFirstTraverser.
BreadthFirstTraverser.
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.true only if the Reference has not been
cleared and the delegate currently has listeners.
int
from 0 to the number of nodes in this graph
(exclusive) if the specified node is in this graph.
Traverser over the children of the
specified node.
Traverser.
Transformer which when given a node, returns a
Traverser over the children of that
node, specified by an OrientedForest.ChildTraverserFactory.
Graph.CirculantGraph.
Closures.ClosureChain.
ClosureChain.
ClosureChain.
Collection which wraps another.CollectionWrapper.
CollectionWrapper.initialize(java.util.Collection), allows a
subclass to initialize the internal state during
deserialization.
Graphs.Graph
implementations for the Plexus Graph Library.Graph objects for
the Plexus Graph Library.Graphs.Graph implementations, but that are unlikely to
be relevant for typical users of the Plexus Graph Library.CompleteBipartiteGraph.
Graph containing a set of Integer
nodes where there is an edge between every pair of nodes.CompleteGraph.
Graph which is a complete tree.CompleteTree.
Collection view of a number of other
Collections.CompositeCollection.
CompositeCollection.
CompositeCollection.
Graph.containsEdge( Object ).
Graph.containsNode( Object ).
Graph.traverser( node,
predicate ) and returns true, if found.
Graph.containsEdge( Object ) if the specified object passes
the Predicate specified by the constructor and is
incident upon the baseNode.
true if this collection contains
References for all of the elements in the specified
collection.
edge,
looking for it and returning true if found.
true if this Graph contains
the specified Graph.Edge.
false.
true if this Graph contains
the specified Graph.Edge.
edge,
looking for it and returning true if found.
false.
true if this Graph contains
the specified node.
true if this Graph contains
the specified node.
true if this Graph contains
node.
true if this Graph contains
node.
Predicate which tests whether an object is an
element of a Collection.ContainsPredicate.
EdgePredicate which tests for
Graph.Edges which look just like the specified
edge.
TraverserPredicate which tests for
Graph.Edges which look just like the specified
edge, ignoring one endpoint.
Graph.Edge.
Graph.Edge.
EdgePredicate which tests for
Graph.Edges that contain the specified user
object, have the specified endpoints, and have the specified
direction relative to firstNode.
TraverserPredicate which tests for
traversals over Graph.Edges that contain the
specified user object, to the specified node,
with a direction specified relative to the endpoint
from which the Graph.Edge is
being traversed.
TraverserPredicate which tests for
traversals to the specified node, with a
direction specified relative to the endpoint
from which the Graph.Edge is
being traversed.
EdgePredicate which tests for
Graph.Edges that have the specified endpoints and
direction relative to firstNode.
EdgePredicate which tests for
Graph.Edges that contain the specified user
object and have the specified directedness.
TraverserPredicate which tests for
traversals over Graph.Edges that contain the
specified user object, with a direction specified relative to
the endpoint from which the
Graph.Edge is being traversed.
EdgePredicate which tests for
Graph.Edges whose contained user object and
endpoints satisfy the specified Predicates, and
which have the specified direction relative to the endpoint
satisyfing the firstNodePredicate.
TraverserPredicate which tests for
traversals over Graph.Edges whose contained user
object satisfies userObjectPredicate, to a node
which satisfies nodePredicate, with a direction
specified relative to the endpoint from which
the Graph.Edge is being traversed.
Reference for the given
arguments.
n nodes where each
pair of nodes has probability prob of having an
edge between them.
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.Cycle.
Graph.Edge implementation
in which the user-defined object must be null.DefaultEdge.
ObservableGraph interface.DefaultGraph.
DefaultGraph which is a copy of the
specified Graph.
DefaultGraph with a capacity for
the specified number of nodes (avoiding unnecessary rehashing).
Transformer which when given a node, returns a
single Edge incident to that node, specified by a
Graph and a Predicate.DefaultIncidentEdgeGetter.
Graph.Edge implementation.DefaultObjectEdge.
Graph and
OrientedForest interfaces.DefaultOrientedForest.
DefaultOrientedForest which is a
copy of the specified Graph.
OrientedForest
interface.DefaultOrientedForestView.
RootedTree
interface.DefaultRootedTreeView.
DefaultRootedTreeView.
Graph.Edge implementation
for a simple graph in which the user-defined object must be
null.DefaultSimpleEdge.
Transformer which when given a node, returns a
Traverser over nodes adjacent to that
node, specified by a Graph and a
Predicate.DefaultTraverserFactory.
traverser(
node, null ) method, counting self-loops twice.
traverser(
node, traverserPredicate ) method, without counting
self-loops twice.
node, defined as the number
of edges incident on node.
node, defined as the number
of edges incident on node.
node, defined as the number
of edges incident on node.
0.
0.
node, defined as the number
of edges incident on node.
node, defined as the number
of edges incident on node.
node, defined as the number
of edges incident on node.
node, defined as the number
of edges incident on node, with self-loops
counted twice.
node for which the
specified Predicate is satisfied, defined as the
number of edges incident on node that pass the
predicate, with self-loops counted only once.
node, defined as the number
of edges incident on node, with self-loops
counted twice.
node, defined as the number
of edges incident on node, with self-loops
counted twice.
Graph.DepthFirstForestView.
DepthFirstForestView.
Traverser for a Graph,
with no cycle detection.DepthFirstTraverser.
DepthFirstTraverser, which
depth-first traverses the descendants of the specified
startNode.
DepthFirstTraverser.
DepthFirstTraverser.
Graph.DepthFirstTreeView starting at
the specified node.
DepthFirstTreeView starting at
the specified node.
Graph.Edge predicate which is
true when directed.
Traverser predicate which is true when
the edge is directed.
Graph and any GraphListeners have been notified.
Graph.
Graph and any GraphListeners have been notified.
Iterator over Edge
objects, presenting a Traverser.EdgeIteratorTraverserAdapter.
EdgeIteratorTraverserAdapter.
Predicates testing Graph.Edges that can be piecewise defined.EdgePredicates.Graph and any GraphListeners have been notified.
Graph.
Graph and any GraphListeners have been notified.
Collection view of all the
Graph.Edges in this Graph.
edges(),
except for when the specified edgePredicate is
either FalsePredicate.INSTANCE or an instance of
EqualPredicate.
Collection.
Graph.Edges from this
Graph that satisfy the specified
predicate.
Traverser.
Graph containing a set of Integer
nodes and no edges.EmptyGraph.
Predicate which simply tests the evaluate( object ) argument for equality with a specified object.EqualPredicate with the specified
test object.
Predicate which is
true if the evaluated object is
.equals() to the specified object, or if both are
null.
Set,
List, and other potential types of
Collections, instances of this class can only be
.equals() to other instances of this class.
.equals(), handling
null appropriately.
Predicate which simply tests for equality with a
specified Graph.Edge.EqualsTraverserPredicate with the
specified test Edge.
true if the specified object
is .equals() to the test object, or if both are
null.
false.
true.
true if the specified object satisfies
this EdgePredicate, and false
otherwise.
true if the specified object satisfies
this TraverserPredicate, and false
otherwise.
true if the second element of the
specified List is .equals() to the
test Edge.
Predicate which always returns false.Predicate which always returns
false.
Collection which presents a filtered view of
another.FilteredCollection.
Iterator.FilteredEdgeIterator which will
throw an IllegalStateException if
remove() is called after hasNext()
without an intervening call to next().
FilteredEdgeIterator which will
have FilteredIterator.remove() delegate to Graph.removeEdge( edge ) if necessary.
Graph implementation.FilteredGraph.
FilteredGraph.initialize(Graph,
Predicate, Predicate), allows a subclass to initialize the
internal state during deserialization.
GraphListener which filters events to be forwarded
to an ObservableGraphDelegate.Iterator.FilteredIterator.
Iterator.FilteredNodeIterator which will
throw an IllegalStateException if
remove() is called after hasNext()
without an intervening call to next().
FilteredNodeIterator which will
have FilteredIterator.remove() delegate to Graph.removeNode( node ) if
necessary.
Traverser.FilteredTraverser which will throw
an IllegalStateException if remove()
or removeEdge() is called after
hasNext() without an intervening call to
next().
FilteredTraverser which will have
FilteredTraverser.remove() and FilteredTraverser.removeEdge() delegate to Graph.removeNode( node ) and Graph.removeEdge( edge ) if necessary.
OrientedForest rooted at a specified node as a RootedTree.ForestTreeAdapter.
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.ForestTreeExtension.
ForestTreeExtension.
GraphListener which forwards events to an ObservableGraphDelegate.Edge returned by AbstractGraph.getIncidentEdge(Object,Predicate) if present, otherwise it
returns null.
null.
node for
which the specified Predicate is satisfied.
Graph.Edge returned by GraphWrapper.getIncidentEdge(Object,Predicate) if present, otherwise it
returns null.
Collection being used by this
ContainsPredicate.
writeObject() method.
writeObject() method.
writeObject() method.
writeObject() method.
0.
EdgePredicate
relative to the first node specification.
TraverserPredicate relative to the node
from which the Graph.Edge is being
traversed.
Edge
accessed by AbstractGraph.edges(Predicate) if present, otherwise it
returns null.
null.
Graph.Edge from this Graph
that satisfies the specified predicate, or
null if no such Graph.Edge exists.
Edge which was traversed to get to
the last node returned by next(), or
null if no Edge was traversed.
Edge which was traversed to get to
the last node returned by next(), or
null if no Edge was traversed.
null.
writeObject() method.
OrientedForest
implementations.
EdgePredicate.
Graph of which this is a view.
Graph for this
DefaultIncidentEdgeGetter.
Graph for this
DefaultTraverserFactory.
GraphListeners.
Graph.Edge.
CompleteTree.
0.
Edge
accessed by AbstractGraph.incidentEdges(Object,Predicate) if
present, otherwise it returns null.
null.
Graph.Edge incident on the specified
node for which the specified
Predicate is satisfied.
RunnableReaper which sleeps for 0.1
seconds after emptying its internal ReferenceQueue of waiting
References and notifying the corresponding
Reapables.
RunnableReaper which sleeps for the
specified number of milliseconds after emptying its internal
ReferenceQueue of waiting References and notifying the
corresponding Reapables.
null if none exists.
OrientedForest implementations.
null if none exists.
aNode if the
specified nodes are equal, and null otherwise.
AndPredicate.
OrPredicate.
AbstractGraph.nodes(Predicate) if present, otherwise it returns
null.
Graph that satisfies the
specified predicate, or null if no
such node exists.
int
from 0 to the number of nodes in this graph
(exclusive) if the specified node is in this graph.
writeObject() method.
AbstractIntegerNodeGraph.
TraverserPredicate.
CompleteTree.
NotPredicate.
List of the argument
Predicates being used by this
AllPredicate.
List of the argument
Predicates being used by this
AnyPredicate.
List of the argument
Closures being used by this
ClosureChain.
List of the argument
Collections being used by this
CollectionChain.
List of the argument
Transformers being used by this
TransformerChain.
OrientedForest for this
ChildTraverserFactory.
OrientedForest for this
ParentEdgeGetter.
Graph.Edge than the specified node.
null if
it doesn't have one.
null if
it doesn't have one.
null.
Edge of the specified node, or
null if it doesn't have one.
null.
Edge.
IllegalArgumentException.
AndPredicate.
OrPredicate.
EdgePredicate.
Graph.Edge.
InstanceofPredicate.
Edge being used by this
EqualsTraverserPredicate.
EqualPredicate.
IdentityPredicate.
Predicate for this
DefaultIncidentEdgeGetter.
Predicate for this
DefaultTraverserFactory.
Graph.Edge.
EdgePredicate.
TraverserPredicate.
Graph.Graph.GraphEvent.
GraphEvents.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.GraphStructureIterator.
Graph which wraps another, transforming its nodes
and edges in some way.GraphTransformer with no
Transformers currently set.
GraphTransformer with the
specified Transformers.
GraphTransformer with the
specified Transformers.
Graph, a particular way of looking at it.Graph which wraps another.GraphWrapper.
GraphWrapper.initialize(Graph),
allows a subclass to initialize the internal state during
deserialization.
Graph.Edge.
Object with a Identifier.toString() value set by the constructor.Identifier with the specified
Identifier.toString() value.
Predicate which simply tests the evaluate( object ) argument for reference equality with a
specified object.IdentityPredicate with the
specified test object.
Predicate which is
true if the evaluated object is the same object
(by reference) as the specified object.
Traverser predicate which is true
when the edge is directed in.
Collection for Graph.Edges to help
implement the Graph.incidentEdges(
Predicate ) method.IncidentEdgeCollection.
IncidentEdgeCollection.
Collection.
Graph.Edges incident on the specified
node for which the specified
Predicate is satisfied.
FalsePredicate instance.
TruePredicate instance.
PetersenGraph instance.
Predicate which tests the evaluate( object ) argument for being an instance of a particular
class.InstanceofPredicate with the
specified test class.
Predicate which is
true if the evaluated object is of the specified
class.
InvertibleTransformer which adds an offset to
Integers.IntegerOffsetTransformer.
Transformer.true if ancestor is actually
an ancestor of descendant.
true if ancestor is actually
an ancestor of descendant.
true if the specified
nodes are equal, and false otherwise.
true if the last node returned by DepthFirstTraverser.next() is being traversed away from the start node,
false if the traversal is on its way back out.
Graph.Edge is
directed.
GraphStructureIterator.next() is a Graph.Edge in the
Graph.
true if this collection contains no
elements; a false return value doesn't signify
anything meaningful.
true if the
iterator().hasNext() returns false.
true if the
iterator().hasNext() returns false.
Edge is a
forest edge.
false.
true if the specified node has no
children.
true if the specified node has no
children.
true.
GraphStructureIterator.next() is a node in the Graph.
OrientedForest.getParent(java.lang.Object) and returns
true if a NoSuchNodeException is not
thrown.
true if the specified node is a
descendant of the root node.
Iterator over the elements of this
Collection.
Iterator over the elements in this
collection, which are the referents of uncleared References.
Graph.traverser( node,
predicate ).
Graph.traverser( node,
predicate ).
Iterators.IteratorChain.
IteratorChain.
IteratorChain.
Graph which is the join of two other
Graphs with disjoint node sets.Join graph.
Iterator over the elements of the
product of the specified collections with the left one
controlling the outer loop.
CartesianProduct of the
specified collections with the left one controlling the outer
loop of its iterator.
Collection which wraps another to provide logging
support.LoggingCollection which
logs to a category corresponding to this class at
the DEBUG level.
LoggingCollection which uses
the specified log at the DEBUG level.
LoggingCollection.
Graph which wraps another to provide logging
support.LoggingGraph which
logs to a category corresponding to this class at
the DEBUG level.
LoggingGraph which uses
the specified log at the DEBUG level.
LoggingGraph.
Iterator which wraps another to provide logging
support.LoggingIterator which
logs to a category corresponding to this class at
the DEBUG level.
LoggingIterator which uses
the specified log at the DEBUG level.
LoggingIterator.
Traverser which wraps another to provide logging
support.LoggingTraverser which
logs to a category corresponding to this class at
the DEBUG level.
LoggingTraverser which uses
the specified log at the DEBUG level.
LoggingTraverser.
Graph.LoopGraph.
Graph
and any GraphListeners have been
notified.
Graph.
Graph and any GraphListeners have been notified.
Graph and any GraphListeners have been notified.
Graph.
Graph and any GraphListeners have been notified.
Collection view of all the nodes
in this Graph.
nodes(),
except for when the specified nodePredicate is
either FalsePredicate.INSTANCE or an instance of
EqualPredicate.
Graph that satisfy
the specified predicate.
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.NoSuchNodeException with
null as its detail message and no cause.
NoSuchNodeException with the
specified detail message and no cause.
NoSuchNodeException with the
specified cause.
NoSuchNodeException with the
specified detail message and cause.
Predicate which returns the logical converse of its
operand.NotPredicate.
Predicate which is the logical
converse of the specified Predicate.
ObservableGraph with no nodes or edges.
Graph which can be listened to for structural
changes.ObservableGraph.ObservableGraphDelegate,
which logs to a category corresponding to this class
at the DEBUG level.
ObservableGraphDelegate,
which uses the specified logger at the DEBUG level.
ObservableGraphDelegate.
Graph so that it can be watched for
structural changes.ObservableGraphWrapper.
ObservableGraphWrapper.initialize(Graph),
allows a subclass to initialize the internal state during
deserialization.
Predicate which returns the logical short-circuit
or of its operands.OrPredicate.
Predicate which is the logical
or of the specified Predicates.
Traverser predicate which is true
when the edge is directed out.
Transformer which when given a node, returns the
parent Edge of that node, specified by an
OrientedForest.ParentEdgeGetter.
Graph containing a set of Integer
nodes connected by a path of edges from the first node to the last
one.Path.
SimpleStack.
m x n planar mesh.PlanarMesh.
SimpleStack.
Traverser for a
Graph, with no cycle detection.PostOrderTraverser.
PostOrderTraverser, which
depth-first traverses the descendants of the specified
startNode.
PostOrderTraverser.
PostOrderTraverser.
Predicates.Traverser for a
Graph, with no cycle detection.PreOrderTraverser.
PreOrderTraverser, which
depth-first traverses the descendants of the specified
startNode.
PreOrderTraverser.
PreOrderTraverser.
m x n prism, where m is the size of
the cycle and n is the size of the path.Prism.
Graph which is the product of two other
Graphs.Product graph.
Traverser to not explore beyond the
last node returned by next().
Traverser which allows its traversal to be modified
by pruning.SimpleStack.
Reapable that it has at least one
reference which has been reclaimed.
Reaper for more
information.Collection.ReapableCollection using the
default Reaper.
ReapableCollection with the
specified Reaper.
Reapables.FilteredIterator.next.
FilteredIterator.remove() if
hasNext() was called after the last calls to both
next() and remove() (if any) and
remove() has not been called after the last call
to next().
true is returned.
Graph the last node
returned by BreadthFirstTraverser.next().
Graph the last node
returned by DepthFirstTraverser.next().
UnsupportedOperationException.
Graph the last node
returned by PreOrderTraverser.next().
Graph the last node
returned by Walker.next(), effectively terminating this
iteration.
Graph.removeEdge( Object ).
Graph.removeNode( Object ).
Graph.traverser( node,
predicate ) and removes the Graph.Edge to the
node, if found.
Graph specified in the constructor is not
null, this implementation will delegate to Graph.removeEdge( edge ) (which may
invalidate this Iterator).
Graph specified in the constructor is not
null, this implementation will delegate to Graph.removeNode( node ) (which may
invalidate this Iterator).
Graph.removeEdge( Object ) if the specified object passes the
Predicate specified by the constructor and is
incident upon the baseNode.
GraphListeners.
edge.
UnsupportedOperationException.
Graph.Edge from this
Graph (optional operation).
UnsupportedOperationException.
UnsupportedOperationException.
Graph the
Edge that would be returned by getEdge().
Graph the
Edge that would be returned by getEdge().
Graph the
Edge that would be returned by getEdge().
Graph the
Edge that would be returned by getEdge() (optional operation).
UnsupportedOperationException.
UnsupportedOperationException.
GraphListener.
GraphListener.
GraphListener.
GraphListener.
GraphListener.
UnsupportedOperationException.
node from this Graph
(optional operation).
UnsupportedOperationException.
UnsupportedOperationException.
UnsupportedOperationException.
UnsupportedOperationException.
Iterator over the elements of the
product of the specified collections with the right one
controlling the outer loop.
CartesianProduct of the
specified collections with the right one controlling the outer
loop of its iterator.
OrientedForest which is restricted to the descendants
of a single root node.Runnable which reaps Reapables.RunnableReaper which sleeps for 0.1
seconds after emptying its internal ReferenceQueue of waiting
References and notifying the corresponding
Reapables.
RunnableReaper which sleeps for the
specified number of milliseconds after emptying its internal
ReferenceQueue of waiting References and notifying the
corresponding Reapables.
Graph.Edge predicate which is
true when the edge is a self-loop.
Traverser predicate which is true
when the edge is a self-loop.
Edge.
UnsupportedOperationException.
Graph.
Graph.Edge.
ArrayList.SimpleStack.
SimpleStack.
SimpleStack.
Collection view.SingletonEdgeCollection.
Iterator over the specified
edge.
Iterator over a single Edge.SingletonEdgeIterator.
SingletonEdgeIterator.
Graph with
the single specified node and no edges.
Graph which contains a single node
and no edges.SingletonGraph.
Collection view.SingletonNodeCollection.
Traverser over the specified
edge.
Traverser over a single Edge.SingletonTraverser.
SingletonTraverser.
Iterator.
iterator() method.
iterator() method.
Graph.degree( node, predicate
).
Graph.degree( node, predicate
).
n outer nodes.Star.
Collection.Collection.
Collection and synchronized upon the specified
object.
Graph.
Graph.Graph.
Graph and synchronized upon the specified object.
Traverser which returns nodes in a topologically
sorted order.TopologicalSortTraverser, where the
traverserPredicate specifies adjacent nodes which
should be returned before a given node.
TopologicalSortTraverser, where the
traverserFactory returns a Traverser
over adjacent nodes which should be returned before
the given node.
TopologicalSortTraverser, where the
traverserFactory returns a Traverser
over adjacent nodes which should be returned before
the given node.
m x n toroidal mesh.ToroidalMesh.
Transformers.TransformerChain.
TransformerChain.
TransformerChain.
GraphListener which transforms nodes and edges
before forwarding them to an ObservableGraphDelegate.Traverser over those
Graph.Edges incident to the specified node.
traverser( node ), except for when the specified
traverserPredicate is either FalsePredicate.INSTANCE or an instance of EqualsTraverserPredicate.
Traverser from node to all
adjacent nodes for which the specified filter is satisfied.
Traverser.
Traverser from node to all
adjacent nodes for which the specified Predicate
is satisfied.
Graph.Traverser, presenting an
Iterator over adjacent nodes.TraverserAdjacentNodeIteratorAdapter.
Traversers.TraveserChain.
TraveserChain.
TraveserChain.
Traverser, presenting an
Iterator over the accessed Edges.TraverserEdgeIteratorAdapter.
Traverser, presenting an
Iterator over the accessed nodes.TraverserNodeIteratorAdapter.
Predicates for traversals
that can be piecewise defined.TraverserPredicates.OrientedForest view of a Graph, where
there is no forest structure.TrivialForestView with strict node-
and edge-checking semantics.
TrivialForestView with the
specified node- and edge-checking semantics.
Predicate which always returns
true.
Predicate which always returns true.Graph.Edge predicate which is
true when undirected.
Traverser predicate which is true
when the edge is undirected.
Graph.
Graph.Graph.
Iterator.UnmodifiableIterator.
Iterator.
Traverser.
Traverser.UnmodifiableTraverser.
transform( Object ) upon the specified object.
Traverser which walks a graph, with no cycle
detection.Walker.
Walker, which
traverses the ancestors of the specified
startNode.
Walker.
Walker.
Edges.n outer
nodes.Wheel.
|
Plexus v0.13.1 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||