|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
A directed graph, defined purely by local conditions. The
vertices and edges can be any objects, as long as Object.equals(java.lang.Object) works properly on them.
| Method Summary | |
Object |
getEndingVertex(Object e)
The ending vertex of edge e. |
Iterator |
iterEdgesFrom(Object v)
Returns an Iterator over all the edges that start at v. |
Iterator |
iterVertices()
Returns an Iterator over all the vertices. |
| Method Detail |
public Iterator iterVertices()
public Iterator iterEdgesFrom(Object v)
v.
public Object getEndingVertex(Object e)
e.
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||