|
|||||||||||
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 | |
List |
getHeads()
Returns a list of entry points for this graph. |
List |
getPredsOf(Object s)
Returns a list of predecessors for the given node in the graph. |
List |
getSuccsOf(Object s)
Returns a list of successors for the given node in the graph. |
List |
getTails()
Returns a list of exit points for this graph. |
Iterator |
iterator()
Returns an iterator for the nodes in this graph. |
int |
size()
Returns the node count for this graph. |
Method Detail |
public List getHeads()
public List getTails()
public List getPredsOf(Object s)
public List getSuccsOf(Object s)
public int size()
public Iterator iterator()
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |