|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface ImmutableGraphEltSet
ImmutableGraphEltSet provides access to the elements of GraphElementSet that does not allow for addition or deletion of nodes or edges.
Method Summary | |
---|---|
int |
edgeCount()
Return the number of Edges in the cumulative Vector. |
int |
edgeNum()
Deprecated. this method has been replaced by the edgeCount() method. |
Edge |
findEdge(Node from,
Node to)
Return an Edge spanning Node from to Node to. |
Node |
findNode(java.lang.String id)
Return the Node whose ID matches the String id, null if no match is found. |
Node |
findNodeLabelContaining(java.lang.String substring)
Return the first Nodes whose label contains the String substring, null if no match is found. |
void |
forAllEdges(TGForEachEdge fee)
iterates through Edges. |
void |
forAllNodePairs(TGForEachNodePair fenp)
iterates through pairs of Nodes. |
void |
forAllNodes(TGForEachNode fen)
iterates through all the nodes. |
Node |
getFirstNode()
Return the first Node, null if none exist. |
Node |
getRandomNode()
Returns a random node, or null if none exist (for making random graphs). |
int |
nodeCount()
Return the number of Nodes in the cumulative Vector. |
int |
nodeNum()
Deprecated. this method has been replaced by the nodeCount() method. |
Method Detail |
---|
int nodeCount()
int nodeNum()
int edgeCount()
int edgeNum()
Node findNode(java.lang.String id)
Node findNodeLabelContaining(java.lang.String substring)
Edge findEdge(Node from, Node to)
Node getRandomNode()
Node getFirstNode()
void forAllNodes(TGForEachNode fen)
void forAllNodePairs(TGForEachNodePair fenp)
void forAllEdges(TGForEachEdge fee)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |