com.touchgraph.graphlayout.graphelements
Interface ImmutableGraphEltSet

All Known Implementing Classes:
GraphEltSet

public interface ImmutableGraphEltSet

ImmutableGraphEltSet provides access to the elements of GraphElementSet that does not allow for addition or deletion of nodes or edges.

Version:
1.21 $Id: ImmutableGraphEltSet.java,v 1.1.1.1 2004/02/06 08:44:07 keesj Exp $
Author:
Alexander Shapiro

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.
 java.util.Collection findNodesByLabel(java.lang.String label)
          Return a Collection of all Nodes whose label matches the String label, 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.
 java.util.Iterator getEdges()
          Return an iterator over the Edges in the cumulative Vector, null if it is empty.
 Node getFirstNode()
          Return the first Node, null if none exist.
 java.util.Iterator getNodes()
          Return an iterator over the Nodes in the cumulative Vector, null if it is empty.
 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

nodeCount

public int nodeCount()
Return the number of Nodes in the cumulative Vector.


nodeNum

public int nodeNum()
Deprecated. this method has been replaced by the nodeCount() method.

Return the current Node count.


getNodes

public java.util.Iterator getNodes()
Return an iterator over the Nodes in the cumulative Vector, null if it is empty.


edgeCount

public int edgeCount()
Return the number of Edges in the cumulative Vector.


edgeNum

public int edgeNum()
Deprecated. this method has been replaced by the edgeCount() method.

Return the current Edge count.


getEdges

public java.util.Iterator getEdges()
Return an iterator over the Edges in the cumulative Vector, null if it is empty.


findNode

public Node findNode(java.lang.String id)
Return the Node whose ID matches the String id, null if no match is found.


findNodesByLabel

public java.util.Collection findNodesByLabel(java.lang.String label)
Return a Collection of all Nodes whose label matches the String label, null if no match is found.


findNodeLabelContaining

public Node findNodeLabelContaining(java.lang.String substring)
Return the first Nodes whose label contains the String substring, null if no match is found.


findEdge

public Edge findEdge(Node from,
                     Node to)
Return an Edge spanning Node from to Node to.


getRandomNode

public Node getRandomNode()
Returns a random node, or null if none exist (for making random graphs).


getFirstNode

public Node getFirstNode()
Return the first Node, null if none exist.


forAllNodes

public void forAllNodes(TGForEachNode fen)
iterates through all the nodes.


forAllNodePairs

public void forAllNodePairs(TGForEachNodePair fenp)
iterates through pairs of Nodes.


forAllEdges

public void forAllEdges(TGForEachEdge fee)
iterates through Edges.



Copyright © 2003-2004 SourceForge. All Rights Reserved.