|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
The interface used by all algorithms to access vertex features.
Method Summary | |
int |
getInDegree()
Get the number of edges that are connected to this vertex on the 'to' end. |
int |
getIndex()
The index of the vertex in the graph. |
java.lang.Object |
getKey()
Returns the vertex key. |
int |
getOutDegree()
Get the number of edges that are connected to this vertex on the 'from' end. |
java.lang.Object |
getValue()
Returns the vertex value. |
java.util.Enumeration |
inEdges()
Creates an enumeration on the edges into the vertex. |
java.util.Enumeration |
mutableInEdges()
Creates an enumeration on the edges into the vertex. |
java.util.Enumeration |
mutableOutEdges()
Creates an enumeration on the edges out of the vertex. |
java.util.Enumeration |
outEdges()
Creates an enumeration on the edges out of the vertex. |
Methods inherited from interface drasys.or.graph.ElementI |
getGraph,
isEdge,
isVertex |
Methods inherited from interface drasys.or.graph.VertexValueI |
getCost,
getDemand,
getTime |
Method Detail |
public int getIndex()
public int getInDegree()
public int getOutDegree()
public java.lang.Object getKey()
public java.lang.Object getValue()
public java.util.Enumeration inEdges()
public java.util.Enumeration mutableInEdges()
public java.util.Enumeration outEdges()
public java.util.Enumeration mutableOutEdges()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |