|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Defines the notion of a directed graph.
Method Summary | |
java.util.List |
getHeads()
Returns a list of entry points for this graph. |
java.util.List |
getPredsOf(java.lang.Object s)
Returns a list of predecessors for the given node in the graph. |
java.util.List |
getSuccsOf(java.lang.Object s)
Returns a list of successors for the given node in the graph. |
java.util.List |
getTails()
Returns a list of exit points for this graph. |
java.util.Iterator |
iterator()
Returns an iterator for the nodes in this graph. |
int |
size()
Returns the node count for this graph. |
Method Detail |
public java.util.List getHeads()
public java.util.List getTails()
public java.util.List getPredsOf(java.lang.Object s)
public java.util.List getSuccsOf(java.lang.Object s)
public int size()
public java.util.Iterator iterator()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |