Constructor and Description |
---|
TopologicalSortTraverser(Graph graph,
org.apache.commons.collections.Predicate traverserPredicate)
Creates a new
TopologicalSortTraverser , where the
traverserPredicate specifies adjacent nodes which
should be returned before a given node. |
TopologicalSortTraverser(Graph graph,
org.apache.commons.collections.Transformer traverserFactory)
Creates a new
TopologicalSortTraverser , where the
traverserFactory returns a Traverser
over adjacent nodes which should be returned before
the given node. |
TopologicalSortTraverser(Iterator nodeIter,
org.apache.commons.collections.Transformer traverserFactory)
Creates a new
TopologicalSortTraverser , where the
traverserFactory returns a Traverser
over adjacent nodes which should be returned before
the given node. |
Modifier and Type | Method and Description |
---|---|
Graph.Edge |
getEdge()
Returns the
Edge which was traversed to get to
the last node returned by next() , or
null if no Edge was traversed. |
boolean |
hasNext() |
Object |
next() |
void |
remove() |
void |
removeEdge()
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining
public TopologicalSortTraverser(Graph graph, org.apache.commons.collections.Predicate traverserPredicate)
TopologicalSortTraverser
, where the
traverserPredicate
specifies adjacent nodes which
should be returned before a given node.public TopologicalSortTraverser(Graph graph, org.apache.commons.collections.Transformer traverserFactory)
TopologicalSortTraverser
, where the
traverserFactory
returns a Traverser
over adjacent nodes which should be returned before
the given node.public TopologicalSortTraverser(Iterator nodeIter, org.apache.commons.collections.Transformer traverserFactory)
TopologicalSortTraverser
, where the
traverserFactory
returns a Traverser
over adjacent nodes which should be returned before
the given node.public Graph.Edge getEdge()
Edge
which was traversed to get to
the last node returned by next()
, or
null
if no Edge
was traversed. Note
that because the nodes of the underlying Graph
are visited in no particular order by the internals of this
algorithm, this method may return null
even if
some other adjacent node succeeds this one.
Description copied from interface: Traverser
Returns the Edge
which was traversed to get to
the last node returned by next()
, or
null
if no Edge
was traversed. This
call can be made only if remove()
or removeEdge()
has not been called after the last
call to next()
.
public void removeEdge()
Traverser
Graph
the
Edge
that would be returned by getEdge()
(optional operation). If no Edge
was
traversed (as in the root of a breadth-first search), this
method throws a IllegalStateException
. This
method can be called only once per call to next()
. The behavior of a traverser is unspecified if the
underlying graph structure is modified while the traversal is
in progress in any way other than by calling this method or
remove()
.removeEdge
in interface Traverser
See the Plexus project home, hosted by SourceForge.
Copyright ? 1994-2006, by Phoenix Software Technologists, Inc. and others. All Rights Reserved. Use is subject to license terms.