|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.xistrat.util.d3.vrmlgraph.GraphData
public class GraphData
The class used to store 3-D graph data.
| Constructor Summary | |
|---|---|
GraphData()
Constructor for the GraphData object |
|
| Method Summary | |
|---|---|
void |
addEdge(Edge e)
Adds an Edge to the graph data. |
void |
addNode(Node n)
Adds a Node to the graph data. |
void |
clear()
Clears the entire contents of the graph, including all Nodes and all Edges that may have existed in it. |
int |
countNodes()
Count the number of Nodes stored in the GraphData object. |
java.util.Iterator<Edge> |
getEdgeIterator()
Returns an Iterator of all Edges stored within this class. |
java.util.Iterator<Node> |
getNodeIterator()
Returns an Iterator of all Nodes stored within this class. |
java.util.Iterator<Node> |
getNodeIterator(int index)
Returns an Iterator of all Nodes stored within this class, starting from the Node at index index |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public GraphData()
| Method Detail |
|---|
public java.util.Iterator<Node> getNodeIterator()
public java.util.Iterator<Node> getNodeIterator(int index)
index
index - The index of the LinkedList to start iterating from.
indexpublic java.util.Iterator<Edge> getEdgeIterator()
public void addNode(Node n)
n - The Node to be added to the graph.public void addEdge(Edge e)
e - The edge to be added to the graph.public int countNodes()
public void clear()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||