Package | Description |
---|---|
com.yworks.yfiles.algorithms | |
com.yworks.yfiles.layout |
Provides essential classes and interfaces that constitute the infrastructure for automatic graph layout generation.
|
com.yworks.yfiles.layout.hierarchic |
Provides hierarchic layout style algorithms.
|
com.yworks.yfiles.layout.labeling |
Provides algorithms for the automatic placement of node and edge labels, so called generic labeling algorithms.
|
com.yworks.yfiles.layout.multipage |
Provides the
MultiPageLayout that subdivides the input graph into several smaller graphs whose layouts fit the specified maximum page size. |
com.yworks.yfiles.layout.router |
Provides classes for automatic routing of the edges in a graph.
|
com.yworks.yfiles.layout.router.polyline |
Provides classes and interfaces for automatic polyline routing of the edges of a graph.
|
Modifier and Type | Class and Description |
---|---|
class |
EdgeList
Specialized list implementation for instances of type
Edge . |
class |
NodeList
Specialized list implementation for instances of type
Node . |
Modifier and Type | Method and Description |
---|---|
static YList |
Geom.calcConvexHull(YList points)
Calculates the convex hull for a set of points.
|
static YList |
ShortestPaths.kShortestPaths(Graph graph,
IDataProvider costDP,
Node start,
Node end,
int k)
This method finds the
k shortest paths connecting a pair of nodes in a directed graph with non-negative edge
costs. |
Modifier and Type | Method and Description |
---|---|
static YList |
Geom.calcConvexHull(YList points)
Calculates the convex hull for a set of points.
|
static void |
IntersectionAlgorithm.intersect(YList objects,
IntersectionAlgorithm.IIntersectionHandler iHandler)
Calculates the intersections of rectangles in the plane.
|
void |
YList.splice(YList list)
Transfers the contents of the given list to the end of this list.
|
static Edge |
Triangulator.triangulatePoints(YList points,
Graph result,
INodeMap resultMap,
IEdgeMap reverseEdgeMap)
Computes a triangulation of the given points.
|
Modifier and Type | Method and Description |
---|---|
YList |
PartitionGrid.getColumns()
Gets the columns of the
partition grid . |
YList |
SliderEdgeLabelLayoutModel.getLabelCandidates(IEdgeLabelLayout labelLayout,
IEdgeLayout edgeLayout,
INodeLayout sourceLayout,
INodeLayout targetLayout)
Returns all
EdgeLabelCandidate s that describe valid label positions within this model. |
YList |
IEdgeLabelLayoutModel.getLabelCandidates(IEdgeLabelLayout labelLayout,
IEdgeLayout edgeLayout,
INodeLayout sourceLayout,
INodeLayout targetLayout)
Returns all
EdgeLabelCandidate s that describe valid label positions within this model. |
YList |
FreeEdgeLabelLayoutModel.getLabelCandidates(IEdgeLabelLayout labelLayout,
IEdgeLayout edgeLayout,
INodeLayout sourceLayout,
INodeLayout targetLayout)
Returns the
EdgeLabelCandidate that describes the current label position. |
YList |
DiscreteEdgeLabelLayoutModel.getLabelCandidates(IEdgeLabelLayout label,
IEdgeLayout edgeLayout,
INodeLayout sourceNode,
INodeLayout targetNode) |
YList |
INodeLabelLayoutModel.getLabelCandidates(INodeLabelLayout labelLayout,
INodeLayout nodeLayout)
Returns all
NodeLabelCandidate s that describe valid label positions within this model. |
YList |
FreeNodeLabelLayoutModel.getLabelCandidates(INodeLabelLayout labelLayout,
INodeLayout nodeLayout)
Returns the
NodeLabelCandidate that describes the current label position. |
YList |
DiscreteNodeLabelLayoutModel.getLabelCandidates(INodeLabelLayout labelLayout,
INodeLayout nodeLayout) |
YList |
LayoutGraph.getPathList(Edge edge)
Returns the path of an edge, including the ports.
|
YList |
LayoutGraph.getPointList(Edge edge)
Returns the control points of an edge.
|
YList |
PartitionGrid.getRows()
Gets the list of rows of the
partition grid . |
Modifier and Type | Method and Description |
---|---|
void |
LayoutGraph.setPath(Edge edge,
YList path)
Sets the path of the given edge.
|
void |
LayoutGraph.setPoints(Edge edge,
YList points)
Sets the control points of the given edge.
|
Modifier and Type | Method and Description |
---|---|
YList |
ILayer.getSameLayerEdges()
|
Modifier and Type | Method and Description |
---|---|
void |
SelfLoopCalculator.calculateSelfLoops(LayoutGraph graph,
Node node,
YList selfLoops,
IDataProvider spc,
IDataProvider tpc)
Convenience method that calculates a list of self-loops that belong to a given node.
|
void |
ILayer.setNodeOrder(YList list)
|
Modifier and Type | Method and Description |
---|---|
void |
AbstractLabeling.label(LayoutGraph graph,
YList nodeLabels,
YList edgeLabels)
Places the labels of the input graph restricting the placement to labels contained in the given lists.
|
Modifier and Type | Method and Description |
---|---|
Node |
IElementFactory.createConnectorNode(LayoutContext context,
YList edgesIds,
Object representedNodeId)
Callback method for creating a node of type
NodeType.CONNECTOR . |
Node |
DefaultElementFactory.createConnectorNode(LayoutContext context,
YList edgeIds,
Object representedNodeId) |
protected boolean |
MultiPageLayout.removeConnectorPair(Node connector1,
Node connector2,
YList originalEdgeIds,
LayoutContext context)
This method is called during a postprocessing step that reduces the number of connectors.
|
Modifier and Type | Method and Description |
---|---|
protected double |
OrthogonalPatternEdgeRouter.calculateBendCost(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the costs for all bends of the given path.
|
protected double |
OrthogonalPatternEdgeRouter.calculateCost(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the edge cost of a possible edge path, in order to determine which path is the best, i.e., the cheapest.
|
protected double |
OrthogonalPatternEdgeRouter.calculateCrossingCosts(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the overall crossing costs of the given path, including edge crossings, edge overlaps and node crossings.
|
protected double |
OrthogonalPatternEdgeRouter.calculateEdgeLength(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the costs for the length of the given path.
|
protected double |
OrthogonalPatternEdgeRouter.calculatePortCandidateCost(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the costs for the chosen
PortCandidate s. |
protected double |
OrthogonalPatternEdgeRouter.calculateSelfLoopSelfSidePenaltyCost(Edge edge,
YList path,
PortCandidate spc,
PortCandidate tpc)
Calculates the extra penalty that is added to the path's cost if the edge is a self-loop and source and target ports
have the same direction.
|
Modifier and Type | Method and Description |
---|---|
YList |
EdgeInfo.calculatePathPoints()
Calculates a list of
YPoint s containing the source port, bend and target port locations. |
YList |
EdgeCellInfo.getCellSegmentInfos()
Calculates the list of
CellSegmentInfo s for the segment parts of this edge that lie within the associated
partition cell . |
Modifier and Type | Method and Description |
---|---|
protected Comparator<Object> |
ChannelBasedPathRouting.createSegmentInfoComparator(YList channels,
PathSearchResult pathSearchResult,
PathSearchConfiguration configuration)
Creates a
comparator for sorting the SegmentInfo s in a Channel from left to right
(for vertical segments) or top to bottom (for horizontal segments), respectively. |