All Packages Class Hierarchy This Package Previous Next Index
java.lang.Object | +----relaaja.netlayout.VGJ.Spring
private DRect rectxmax
private double xmaxxmin
private double xminymax
private double ymaxymin
private double yminorderedList
private int orderedList[]N
private int NEDGES
private int EDGESD
private long D[][]K
private double K[][]Ko
private double KoL
private double L[][]epsilon
private double epsilondelta
private double delta[]MAX_TIMES_REPOSITIONED
private int MAX_TIMES_REPOSITIONEDnumTimesRepositioned
private int numTimesRepositionedNUM_TIMES_MOVED
private int NUM_TIMES_MOVED[]HY_SIZE
private int HY_SIZEHY_PERCENTAGE
private int HY_PERCENTAGEE
private double EE_HY
private double E_HY[]COUNTER
private int COUNTERmv
private Node mvpartial_x
private double partial_xpartial_y
private double partial_ypartial_xx
private double partial_xxpartial_xy
private double partial_xypartial_yx
private double partial_yxpartial_yy
private double partial_yyconnected
private boolean connectedbiggest
private double biggests_biggest
private double s_biggestaverage
private double averagearea
private double areacount
private int countedges
private Edge edges[]
public Spring()
public Graph compute(Graph G)Initialize
private void Initialize(Graph G)findBiggest
private double findBiggest(Graph G)findDistances
private void findDistances(Graph G, int k)makeOrderedList
private void makeOrderedList(Graph G)enum
private int enum(int Index)find_l_and_k
private void find_l_and_k(Graph G)findDelta2
private double findDelta2(Graph G, Node v)findPartials
private void findPartials(Graph G, Node v)TempFunction
private double TempFunction(double del, double times)findE
private double findE(Graph G)MoveToNewPosition
private void MoveToNewPosition(Graph G)MoveToNewPosition1
private void MoveToNewPosition1(Graph G)MoveToNewPosition2
private void MoveToNewPosition2(Graph G)CheckPositions
private void CheckPositions(Graph G)
All Packages Class Hierarchy This Package Previous Next Index