|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
GraphLayoutAttrBuilder
s.Boolean
and then
returns it.
Dimension
-object whose width is
the first element of the pair and height is the second element.
Double
and then
returns it.
Integer
and
then returns it.
Double
and then returns it.
Integer
and then returns it.
EdgeGapAttr
EdgeLabelAttr
EdgeMinLengthAttr
EdgeTypeAttr
EdgeWeightAttr
FlowTrendAttr
NodeExtentAttr
NodeGapAttr
NodeGroupingAttr
NodeOrderingAttr
NodeRankingAttr
Dimension
.
Commands
.LinearComponentLayoutPolicy
ComponentLayoutPolicy
-interface.4.0
.
1
.
1.0
.
0
.
NodeExtentAttr
NodeGapAttr
NodeOrderingAttr
EdgeWeightAttr
NodeExtentAttr
NodeGapAttr
EdgeMinLengthAttr
NodeGroupingAttr
EdgeMinLengthAttr
EdgeWeightAttr
NodeRankingAttr
EdgeGapAttr
NodeExtentAttr
EdgeWeightAttr
NodeExtentAttr
NodeGapAttr
NodeExtentAttr
NodeGapAttr
NodeGapAttr
SimplisticEdgeRoutingPolicy
SplineEdgeRoutingPolicy
EdgeRoutingPolicy
-interface.width
- and height
-fields of
the given dimension object and returns the same object.
null
.
GraphLayoutAlgChassis
.GraphLayoutAlg
-interface.GraphLayoutAlgGen
-class.GraphLayoutAlgGen
.GraphLayoutAttrBuilder
s as
needed.GraphLayoutAttrMap
.GraphLayoutAttrs
.GraphParser
.GraphLayoutAlgProgressPolicy.NULL_PROGRESS_POLICY
);
layout
-method is entered before any layoutProgress
calls are made.
layoutFinish
if the
layout computation was cancelled due to an exception.
layout
-method is about to return, either normally or as the result
of an exception, and after all the layoutProgress
calls have been made.
0.0
and 1.0
at appropriate
moments in the computation.
Dimension
s.AbstractGraphLayoutAttrBuilder.newAttr(Map,Map)
.
AbstractGraphLayoutAttrBuilder.newAttr()
to build attribute object.
GraphLayoutAttrBuilder
.
NodeOrderingPolicyWithTransposeDecorator
HeuristicNodeOrderingPolicy
SimplisticNodeOrderingPolicy
HeuristicNodePositioningPolicy
OptimalNodePositioningPolicy
SimplisticCenteringNodePositioningPolicy
SimplisticNodePositioningPolicy
NodeRankingPolicyWithGroupingDecorator
NodeRankingPolicyWithPartialOrderDecorator
ExplicitNodeRankingPolicy
OptimalNodeRankingPolicy
SimplisticNodeRankingPolicy
NodeOrderingPolicies
.NodeOrderingPolicy
-interface.NodeOrderingPolicy
-classes.NodePositioningPolicy
-interface.NodeRankingPolicies
.NodeRankingPolicy
-interface.NodeRankingPolicy
-classes.EdgeWeightAttr
) while respecting minimum edge length
constraints (EdgeMinLengthAttr
). extents
array, in which the extents (corresponding to
layouts) are to be placed into the final layout.
rankToNumNodesTable()[rankIdx]
is the number of nodes
in rank rankIdx
.
AbstractGraphLayoutAttrBuilder.keys()
, then puts the
(key
(key, nodeOrEdge), value
(key,
value))
-pair into a map.
AbstractGraphLayoutAttrBuilder.globalKeys()
, then
puts the (globalKey, value
(globalKey,
value))
-pair into a map.
Commands
-class produces expected results.
GraphLayoutAttrs.attrClasses(suvi.api.alg.attr.GraphLayoutAttr)
-method, making sure
that the method returns all the interfaces.
NodeOrderingPolicies.crossings(javautils.graph.adt.Graph, suvi.alg.interfaces.AugmentedNodeRanking, javautils.maps.ObjectToIntMap)
-method using a
test case designed to exhibit most, if not all, possible cases and
asserting that the actual result agrees with the expected result.
Commands
-class is the expected result.
GraphLayoutAlgGen
-class by using them on a random graph.
Graph
-interface for the Suvi
Testing Application.Commands
-class
throws an exception, as expected.
Commands
-class produces
the expected results.
GraphLayoutAlgChassisTest
NodeOrderingPoliciesTest
NodeRankingPoliciesTest
GraphLayoutAttrsTest
GraphLayoutAlgGenTest
GraphParserTest
CommandsTest
Commands
-class
produces the expected results.
testForgottenSemi
test case but with the
forgotten semicolon back in.
BSpline
-object transformed by the matrix.
Point
-object transformed by the matrix.
FlowTrendConstants.FT_CANONICAL
-trend from the requested trend.
BSpline
with all control points translated by the
vector.
null
GraphLayoutAttr
-object.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |