|
JGraphLayout |
||||||||||
PREV NEXT | FRAMES NO FRAMES |
JGraphCompoundLayout.layouts
.
e
array
to this node.
JGraphFacade.createNestedMap(boolean, Point2D)
with an origin or null depending on flushOrigin
.
length
node
.
forceConstant
^2 for performance
bounds
map.
cell
.
v1
and
v2
wrt distanceFunction
.
bounds
map.
bounds
map.
distanceFunction
.
v1
and
v2
wrt cf
with traverses no more than
steps
edges.
index
to be used by tree layouts for
tree traversal.
isStopped
.
moveRadius
.
cell
is a root.
maximum
.
maxDistanceLimit
squared
minDistanceLimit
squared
minDistanceLimit
squared
JGraphOrganicLayout.moveRadius
reaches this value, the algorithm is terminated
progress
.
moveRadius
is multiplied by after
every iteration.
JGraphCompoundLayout.layouts
false
.
bounds
to fit into the
specified frame
dx
and
dy
to the respective location axes of the cell, then by
scaling them by scalex
and scaley
locations
.
cells
with respect to
cf
.
cells
with respect to
cf
.
Annealing
, the name of this algorithm.
FR
, the name of this algorithm.
ISOM
, the name of this algorithm.
Spring
, the name of this algorithm.
Hierarchical
, the name of this algorithm.
Fast Organic
, the name of this algorithm.
Annealing
, the name of this algorithm.
Self Organizing
, the name of this algorithm.
Orthogonal Edges
, the name of this algorithm.
Compact Tree
, the name of this algorithm.
Moen
, the name of this algorithm.
Radialtree
, the name of this algorithm.
Tree
, the name of this algorithm.
maxIterationsMultiple
since the number of iterations
required in linear with the number of nodes
dx
and
dy
to the respective location axes of the cell,
positionMultipleTrees
is true
this value
is the minimum distance between each overlapping tree structure after
they are separated
a
and b
in constant time
using a union by rank on the tree size.
|
JGraphLayout |
||||||||||
PREV NEXT | FRAMES NO FRAMES |