static int |
Node.getCount(Node r,
int n) |
Recursively finds the number of visible nodes there are (this may
accidentally count some of the invis nodes).
|
static int |
Node.getGCount(Node r,
int n) |
Recursively finds the number of visible groups of siblings there are.
|
static int |
Node.getHeight(Node r,
int l) |
Recursively finds the number of visible levels there are.
|
static int |
Node.getTotalCount(Node r,
int n) |
Recursively finds the total number of nodes there are.
|
static int |
Node.getTotalGCount(Node r,
int n) |
Recursively finds the total number of groups of siblings there are.
|
static int |
Node.getTotalHeight(Node r,
int l) |
Recursively finds the total number of levels there are.
|
void |
NodePlace.place(Node r) |
The function to call to postion the tree that starts at Node r
|
void |
PlaceNode1.place(Node r) |
Call this function to have each node in the tree starting at 'r' placed in
a visual (not logical, they already are) tree position.
|
void |
PlaceNode2.place(Node r) |
The Funtion to call to have the nodes arranged.
|
void |
Edge.setSource(Node v) |
Set the value of source.
|
void |
Edge.setTarget(Node v) |
Set the value of target.
|