| calcConvexHull (YList) | in
Geom | Calculates the convex hull for a set of points. |
| intersect (YList, IIntersectionHandler) | in
IntersectionAlgorithm | Calculates the intersections of rectangles in the plane. |
| triangulatePoints (YList, Graph, INodeMap, IEdgeMap) | in
TriangulationAlgorithm | Computes a triangulation of the given points. |
| splice (YList) | in
YList | Transfers the contents of the given list to the end of this list. |
| setNodeOrder (YList) | in
ILayer | Adjusts the order of the YNodes of this ILayer instance according to the given order. |
| calculateSelfLoops (LayoutGraph, YNode, YList, IDataProvider, IDataProvider) | in
SelfLoopCalculator | Convenience method that calculates a list of self-loops that belong to a given node. |
| label (LayoutGraph, YList, YList) | in
LabelingBase | Places the labels of the input graph restricting the placement to labels contained in the given lists. |
| setPath (Edge, YList) | in
LayoutGraph | Sets the path of the given edge. |
| setPoints (Edge, YList) | in
LayoutGraph | Sets the control points of the given edge. |
| createConnectorNode (LayoutContext, YList, Object) | in
DefaultElementFactory | |
| createConnectorNode (LayoutContext, YList, Object) | in
IElementFactory | Callback method for creating a node of type CONNECTOR. |
| removeConnectorPair (YNode, YNode, YList, LayoutContext) | in
MultiPageLayout | This method is called during a postprocessing step that reduces the number of connectors. |
| createSegmentInfoComparer (YList, PathSearchResult, PathSearchConfiguration) | in
ChannelBasedPathRouting | Creates a comparator for sorting the SegmentInfos in a Channel from left to right (for vertical segments) or top to bottom (for horizontal segments), respectively. |
| calculateBendCost (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | Calculates the costs for all bends of the given path. |
| calculateCost (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | Calculates the edge cost of a possible edge path, in order to determine which path is the best, i.e., the cheapest. |
| calculateCrossingCosts (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | Calculates the overall crossing costs of the given path, including edge crossings, edge overlaps and node crossings. |
| calculateEdgeLength (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | Calculates the costs for the length of the given path. |
| calculatePortCandidateCost (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | Calculates the costs for the chosen PortCandidates. |
| calculateSelfLoopSelfSidePenaltyCost (Edge, YList, PortCandidate, PortCandidate) | in
OrthogonalPatternEdgeRouter | 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. |