|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NodeGroup | |
---|---|
de.cau.cs.kieler.klay.layered.p3order | Phase 3 - crossing minimization by node reordering. |
Uses of NodeGroup in de.cau.cs.kieler.klay.layered.p3order |
---|
Methods in de.cau.cs.kieler.klay.layered.p3order that return types with arguments of type NodeGroup | |
---|---|
List<NodeGroup> |
NodeGroup.getOutgoingConstraints()
Gets the list of outgoing constraints. |
Methods in de.cau.cs.kieler.klay.layered.p3order with parameters of type NodeGroup | |
---|---|
int |
NodeGroup.compareTo(NodeGroup other)
Compares this with another Object. |
Method parameters in de.cau.cs.kieler.klay.layered.p3order with type arguments of type NodeGroup | |
---|---|
int |
BarycenterHeuristic.minimizeCrossings(List<NodeGroup> layerNodeGroups,
com.google.common.collect.Multimap<LNode,LNode> layoutUnits,
int layerIndex,
boolean preOrdered,
boolean randomize,
boolean forward,
float[] portPos,
Map<LNode,NodeGroup>[] singleNodeNodeGroups)
Minimize the number of crossings for the edges between the given layer and either its predecessor or its successor. |
int |
ICrossingMinimizationHeuristic.minimizeCrossings(List<NodeGroup> layer,
com.google.common.collect.Multimap<LNode,LNode> layoutUnits,
int layerIndex,
boolean preOrdered,
boolean randomize,
boolean forward,
float[] portPos,
Map<LNode,NodeGroup>[] singleNodeNodeGroups)
Minimize the number of crossings for the edges between the given layer and either its predecessor or its successor. |
void |
ForsterConstraintResolver.processConstraints(List<NodeGroup> nodeGroups,
int layerIndex,
Random random,
Map<LNode,NodeGroup>[] singleNodeNodeGroups,
com.google.common.collect.Multimap<LNode,LNode> layoutUnits)
Finds and handles violated constraints. |
void |
IConstraintResolver.processConstraints(List<NodeGroup> nodeGroups,
int layerIndex,
Random random,
Map<LNode,NodeGroup>[] singleNodeNodeGroups,
com.google.common.collect.Multimap<LNode,LNode> layoutUnits)
Finds and handles violated constraints. |
Constructors in de.cau.cs.kieler.klay.layered.p3order with parameters of type NodeGroup | |
---|---|
NodeGroup(NodeGroup nodeGroup1,
NodeGroup nodeGroup2,
Random graphRandom)
Constructs a new vertex that is the concatenation of the given two vertices. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |