|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use LNode | |
---|---|
de.cau.cs.kieler.klay.layered | Base package of the layered layouter. |
de.cau.cs.kieler.klay.layered.graph | Basic structures for the layered layouter. |
de.cau.cs.kieler.klay.layered.intermediate | Intermediate layout processors. |
de.cau.cs.kieler.klay.layered.p3order | Phase 3 - crossing minimization by node reordering. |
de.cau.cs.kieler.klay.layered.p5edges | Phase 5 - edge routing and horizontal node placement. |
de.cau.cs.kieler.klay.layered.properties | This package contains classes defining layout properties for KLay Layered. |
Uses of LNode in de.cau.cs.kieler.klay.layered |
---|
Methods in de.cau.cs.kieler.klay.layered that return LNode | |
---|---|
protected LNode |
AbstractGraphImporter.createExternalPortDummy(Object port,
PortConstraints portConstraints,
PortSide portSide,
int netFlow,
KVector portNodeSize,
KVector portPosition,
KVector portSize)
Creates a dummy for an external port. |
static LNode |
Util.getRelatedCompoundNode(LNode node,
LayeredGraph layeredGraph)
Get the compound node an LNode belongs to. |
Methods in de.cau.cs.kieler.klay.layered that return types with arguments of type LNode | |
---|---|
static LinkedList<LNode> |
Util.getChildren(LNode node)
Get the given node's children list. |
Methods in de.cau.cs.kieler.klay.layered with parameters of type LNode | |
---|---|
static LinkedList<LNode> |
Util.getChildren(LNode node)
Get the given node's children list. |
protected KVector |
AbstractGraphImporter.getExternalPortPosition(LayeredGraph graph,
LNode portDummy,
double portWidth,
double portHeight)
Calculates the position of the external port's top left corner from the position of the given dummy node that represents the port. |
static LGraphElement |
Util.getParent(LNode child)
Finds and returns the given node's parent's representative in the LayeredGraph. |
static LNode |
Util.getRelatedCompoundNode(LNode node,
LayeredGraph layeredGraph)
Get the compound node an LNode belongs to. |
static boolean |
Util.isDescendant(LNode child,
LNode parent)
Determines whether the given child node is a descendant of the parent node. |
static LPort |
Util.provideCollectorPort(LNode node,
PortType type,
PortSide side)
Return a collector port of given type, creating it if necessary. |
Method parameters in de.cau.cs.kieler.klay.layered with type arguments of type LNode | |
---|---|
static void |
Util.propagatePair(LinkedList<LNode> sourceTargetList,
HashMap<KGraphElement,LGraphElement> elemMap)
Finds for a pair of LNodes the pair of ancestors with a common parent that is highest in depth in the inclusion tree. |
protected void |
KGraphImporter.transformNode(KNode node,
List<LNode> layeredNodes,
Map<KGraphElement,LGraphElement> elemMap,
Set<GraphProperties> graphProperties,
Direction direction)
Transforms the given node. |
Uses of LNode in de.cau.cs.kieler.klay.layered.graph |
---|
Methods in de.cau.cs.kieler.klay.layered.graph that return LNode | |
---|---|
LNode |
LPort.getNode()
Returns the node that owns this port. |
Methods in de.cau.cs.kieler.klay.layered.graph that return types with arguments of type LNode | |
---|---|
List<LNode> |
LayeredGraph.getLayerlessNodes()
Returns the list of nodes that are not currently assigned to a layer. |
List<LNode> |
Layer.getNodes()
Returns the list of nodes. |
Iterator<LNode> |
Layer.iterator()
Returns an iterator over the contained nodes. |
Methods in de.cau.cs.kieler.klay.layered.graph with parameters of type LNode | |
---|---|
void |
LPort.setNode(LNode node)
Sets the owning node and adds itself to the node's list of ports. |
Uses of LNode in de.cau.cs.kieler.klay.layered.intermediate |
---|
Methods in de.cau.cs.kieler.klay.layered.intermediate with parameters of type LNode | |
---|---|
static Layer |
CompoundSideProcessor.findSpanEnd(LNode upperBorder,
List<Layer> layers)
Finds the layer, in which the closing Compound Dummy Nodes for upperBorder are placed. |
Uses of LNode in de.cau.cs.kieler.klay.layered.p3order |
---|
Methods in de.cau.cs.kieler.klay.layered.p3order that return types with arguments of type LNode | |
---|---|
List<LNode> |
NodeGroup.getNodes()
Gets the nodes-list. |
Methods in de.cau.cs.kieler.klay.layered.p3order with parameters of type LNode | |
---|---|
protected void |
AbstractCrossingMinimizer.assignPortPos(LNode[] layer)
Determine positions for all ports in the given layer. |
void |
IPortDistributor.calculatePortRanks(LNode[] layer)
Determine positions for all ports in the given layer. |
void |
NodeRelativePortDistributor.calculatePortRanks(LNode[] layer)
Determine positions for all ports in the given layer. |
protected int |
CompoundGraphLayerCrossingMinimizer.compoundMinimizeCrossings(LNode[] layer,
int layerIndex,
boolean forward,
boolean preOrdered,
boolean randomize,
LayeredGraph layeredGraph)
Uses an ICrossingMinimizationHeuristic to compute a node order for a given layer. |
protected void |
AbstractCrossingMinimizer.distributePorts(LNode[][] layeredGraph)
Distribute the ports of the layered graph depending on the port constraints. |
void |
IPortDistributor.distributePorts(LNode[][] layeredGraph)
Distribute the ports of the layered graph depending on the port constraints. |
void |
NodeRelativePortDistributor.distributePorts(LNode[][] layeredGraph)
Distribute the ports of the layered graph depending on the port constraints. |
protected List<LPort> |
AbstractCrossingMinimizer.getSortedInputPorts(LNode node)
Returns a list of input ports, beginning at the top right port of the eastern side, going clockwise. |
List<LPort> |
IPortDistributor.getSortedInputPorts(LNode node)
Returns a list of input ports, beginning at the top right port of the eastern side, going clockwise. |
List<LPort> |
NodeRelativePortDistributor.getSortedInputPorts(LNode node)
Returns a list of input ports, beginning at the top right port of the eastern side, going clockwise. |
Method parameters in de.cau.cs.kieler.klay.layered.p3order with type arguments of type LNode | |
---|---|
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 |
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. |
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 |
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. |
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 LNode | |
---|---|
NodeGroup(LNode node,
Random graphRandom)
Constructs a new instance containing the given node. |
Constructor parameters in de.cau.cs.kieler.klay.layered.p3order with type arguments of type LNode | |
---|---|
CompoundGraphLayerCrossingMinimizer(IPortDistributor selPortDistributor,
Random graphRandom,
boolean handleHierarchy,
float[] portRanks,
Map<LNode,NodeGroup>[] oneNodeNodeGroups,
com.google.common.collect.Multimap<LNode,LNode> layoutUnit)
Constructs a CompoundGraphLayerCrossingMinimizer with the given IPortDistributor, Random, isCompound, portPos array, single-node-nodeGroup map and layoutUnits. |
|
CompoundGraphLayerCrossingMinimizer(IPortDistributor selPortDistributor,
Random graphRandom,
boolean handleHierarchy,
float[] portRanks,
Map<LNode,NodeGroup>[] oneNodeNodeGroups,
com.google.common.collect.Multimap<LNode,LNode> layoutUnit)
Constructs a CompoundGraphLayerCrossingMinimizer with the given IPortDistributor, Random, isCompound, portPos array, single-node-nodeGroup map and layoutUnits. |
Uses of LNode in de.cau.cs.kieler.klay.layered.p5edges |
---|
Method parameters in de.cau.cs.kieler.klay.layered.p5edges with type arguments of type LNode | |
---|---|
int |
OrthogonalRoutingGenerator.routeEdges(LayeredGraph layeredGraph,
Iterable<LNode> sourceLayerNodes,
int sourceLayerIndex,
Iterable<LNode> targetLayerNodes,
double startPos)
Route edges between the given layers. |
int |
OrthogonalRoutingGenerator.routeEdges(LayeredGraph layeredGraph,
Iterable<LNode> sourceLayerNodes,
int sourceLayerIndex,
Iterable<LNode> targetLayerNodes,
double startPos)
Route edges between the given layers. |
Uses of LNode in de.cau.cs.kieler.klay.layered.properties |
---|
Fields in de.cau.cs.kieler.klay.layered.properties with type parameters of type LNode | |
---|---|
static IProperty<List<LNode>> |
Properties.BARYCENTER_ASSOCIATES
A list of nodes whose barycenters should go into the barycenter calculation of the node this property is set on. |
static IProperty<List<LNode>> |
Properties.BOTTOM_COMMENTS
List of comment boxes that are placed in the bottom of of a node. |
static IProperty<LinkedList<LNode>> |
Properties.CHILDREN
List of nodes that are children (direct descendants) of the node that is represented by the property holder. |
static IProperty<LNode> |
Properties.COMPOUND_NODE
UPPER_BORDER_DUMMY node determining the compound node this dummy node belongs to. |
static IProperty<LNode> |
Properties.EXT_PORT_REPLACED_DUMMY
External port dummies that represent northern or southern external ports are replaced by new dummy nodes during layout. |
static IProperty<LNode> |
Properties.IN_LAYER_LAYOUT_UNIT
The layout unit a node belongs to. |
static IProperty<LNode> |
Properties.IN_LAYER_SUCCESSOR_CONSTRAINT
Indicates that a node x may only appear inside a layer before the node y the
property is set to. |
static IProperty<LNode> |
Properties.SIDE_OWNER
LNode that is the left border node for the compound node the side dummy guards the side of. |
static IProperty<List<LNode>> |
Properties.TOP_COMMENTS
List of comment boxes that are placed on top of a node. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |