de.aitools.iv.graphdrawing.misc
Class ReingoldTilfordGraph
java.lang.Object
de.aitools.iv.graphdrawing.misc.ReingoldTilfordGraph
public class ReingoldTilfordGraph
- extends java.lang.Object
- Author:
- Frank Benteler
stores the data structures of the Reingold-Tilford algorithm.
The algorithm needs the arrays childrenCount[] and children[][]. All others
are filled within the algorithm.
All arrays have to have the same length!
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
childrenCount
public int[] childrenCount
children
public int[][] children
offset
public int[] offset
posX
public int[] posX
posY
public int[] posY
leftContour
public int[] leftContour
leftContourOffset
public int[] leftContourOffset
rightContour
public int[] rightContour
rightContourOffset
public int[] rightContourOffset
leftBottomMost
public int[] leftBottomMost
leftBottomMostOffset
public int[] leftBottomMostOffset
rightBottomMost
public int[] rightBottomMost
rightBottomMostOffset
public int[] rightBottomMostOffset
ReingoldTilfordGraph
public ReingoldTilfordGraph()
generateDataStructure
public void generateDataStructure(int vertexCount,
int maxChildrenCount)
resetInternalData
public void resetInternalData()
disposeDataStructure
public void disposeDataStructure()
debugPrintAll
public void debugPrintAll()
debugPrintGraphML
public void debugPrintGraphML(int root)