Class CGDGraph
java.lang.Object
repast.simphony.visualization.cgd.graph.CGDGraph
- All Implemented Interfaces:
Cloneable
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
addDummyNode
(int index) void
addEdge
(int x, int y) void
addEdge
(int x, int y, Point2D.Double[] _edgePoints) void
addNode
(int index) void
buildNodeLayout
(ParseClanTree _root, int numNodes, int initialNumNodes, TreeSet[] parentRel) Initializing bounding box placementchildren
(int n) Children of all the nodes n leads toclone()
void
compute()
void
void
getEdge
(int x, int y) getEdges()
int
int
getNode
(int ix) getNodes()
int
parents
(int n) Parents of all the nodes leading to nTreeSet[]
This method assigns a list of children to each node.boolean
removeEdge
(int x, int y) void
void
setMaxEIndex
(int i) void
setMaxNIndex
(int i) void
-
Constructor Details
-
CGDGraph
public CGDGraph() -
CGDGraph
-
-
Method Details
-
addNode
public void addNode(int index) -
addDummyNode
public void addDummyNode(int index) -
setNodes
-
getNodes
-
setEdges
-
getEdges
-
getEdge
-
getNode
-
clone
-
copy
-
compute
public void compute() -
processChildRelation
This method assigns a list of children to each node. Next it stores in the array of TreeSet's (each for each node) and returns to a caller.- Returns:
- TreeSet[]
-
addEdge
public void addEdge(int x, int y) -
addEdge
-
removeEdge
public boolean removeEdge(int x, int y) -
getGraphUtil
-
buildNodeLayout
public void buildNodeLayout(ParseClanTree _root, int numNodes, int initialNumNodes, TreeSet[] parentRel) Initializing bounding box placement -
parents
Parents of all the nodes leading to n -
children
Children of all the nodes n leads to -
dummysToEdgePaths
public void dummysToEdgePaths() -
getMaxNIndex
public int getMaxNIndex() -
setMaxNIndex
public void setMaxNIndex(int i) -
getMaxEIndex
public int getMaxEIndex() -
setMaxEIndex
public void setMaxEIndex(int i) -
getNumOfNodes
public int getNumOfNodes()
-