-
This will build A node structure from the dotty format passed.
static int
Recursively finds the number of visible nodes there are (this may
accidentally count some of the invis nodes).
static int
Recursively finds the number of visible groups of siblings there are.
static int
Recursively finds the number of visible levels there are.
static int
Recursively finds the total number of nodes there are.
static int
Recursively finds the total number of groups of siblings there are.
static int
Recursively finds the total number of levels there are.
void
The function to call to postion the tree that starts at Node r
void
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
The Funtion to call to have the nodes arranged.
void
void
Constructs Displayer with the specified Node as the top of the tree, and
uses the NodePlacer to place the Nodes.