|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
The Navigator
interface allows graph algorithms to
detect (and use) the arcs from and to a certain node. This allows
the use of many graph algorithms (eg construction of strongly
connected components) even for very general graphs where the arcs
model only a subtle semantic relation (eg caller-callee) that is
not directly stored in the structure of the nodes.
Method Summary | |
Object[] |
next(Object node)
Returns the predecessors of node . |
Object[] |
prev(Object node)
Returns the successors of node . |
Method Detail |
public Object[] next(Object node)
node
.
public Object[] prev(Object node)
node
.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |