|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
A directed graph whose nodes are unique Objects and whose edges are unlabeled but ordered.
| Method Summary | |
Object |
getEdgeSource(int i)
The source node of edge number i. |
Object |
getEdgeTarget(int i)
The target node of edge number i. |
Collection |
getIncomingEdges(Object v)
A Collection of indices (Integer objects) of edges coming into node v. |
Collection |
getNodes()
A Collection of nodes in the strategy graph. |
Collection |
getOutgoingEdges(Object v)
A Collection of indices (Integer objects) of edges going out of node v. |
int |
numEdges()
The number of edges in the strategy graph. |
| Method Detail |
public Collection getNodes()
public Collection getOutgoingEdges(Object v)
public Collection getIncomingEdges(Object v)
public int numEdges()
public Object getEdgeSource(int i)
public Object getEdgeTarget(int i)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||