- All Implemented Interfaces:
It will place these nodes so that they fall at evenly below their parent. It will then go through and look for places where nodes fall on the wrong side of other nodes when it finds one it will trace back up the tree to find the first common sibling group these two nodes have And it will adjust the spacing between these two siblings so that the two nodes no longer overlap. This is nasty to calculate with , and takes a while with the current algorithm I am using to do this.
- $Revision: 10222 $
- Malcolm Ware (firstname.lastname@example.org)