|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface GraphTraversalAlg
Base class for all algorithms which traverse a graph in a certain order. Traversal algorithms collaborate with a TraversalVisitor. This object is called during the traveral and may be used to collect information or perform actions on the nodes and edges of the graph.
Method Summary | |
---|---|
TraversalVisitor |
getVisitor()
|
void |
setLocalStartNode(Node startNode)
If a start node is set, the traversal will start from there and only thos nodes which are reachable from the start node will be explored. |
void |
setUseOnlyOutgoingEdges(boolean useOnlyOutgoingEdges)
If this flag is set to true, the underlying graph must have the OutgoingEdgeNeighborhood-property and only outgoing edges will be considered when the neigbors of a node are visited. |
void |
setVisitor(TraversalVisitor visitor)
Set the visitor object which will be called during the traversal. |
Methods inherited from interface net.sourceforge.combean.interfaces.graph.alg.GraphAlgorithm |
---|
getGraph, run, setGraph |
Method Detail |
---|
void setVisitor(TraversalVisitor visitor)
visitor
- TraversalVisitor getVisitor()
void setLocalStartNode(Node startNode)
startNode
- void setUseOnlyOutgoingEdges(boolean useOnlyOutgoingEdges)
useOnlyOutgoingEdges
-
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |