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.organic |
Provides organic layout style algorithms that are based on a force-directed layout paradigm.
|
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.
|
com.yworks.yfiles.layout.tree |
Provides tree layout style algorithms.
|
Modifier and Type | Method and Description |
---|---|
static Edge |
Triangulator.calcDelauneyTriangulation(Graph result,
IDataProvider pointData,
IEdgeMap revMap)
Computes a Delauney triangulation of the given points.
|
Edge |
Edge.createCopy(Graph g,
Node v,
Node w)
Creates a copy of this edge that will be inserted into the given graph connecting the given source and target nodes.
|
Edge |
Graph.createEdge(Node v,
Edge e1,
Node w,
Edge e2,
GraphElementInsertion d1,
GraphElementInsertion d2)
Creates a new edge in this graph to be ordered before or after a given edge and fires a corresponding notification event
to inform registered listeners.
|
Edge |
Graph.createEdge(Node v,
Node w)
Creates a new edge in this graph and fires a corresponding notification event to inform registered listeners.
|
Edge |
IEdgeCursor.edge()
Gets the edge at the current location of the cursor.
|
Edge |
Graph.firstEdge()
Gets the first edge in this graph.
|
Edge |
EdgeList.firstEdge()
Returns the first edge in this list, or
null when the list is empty. |
Edge |
Node.firstInEdge()
Gets the first incoming edge at this node, or
null if it does not exist. |
Edge |
Node.firstOutEdge()
Gets the first outgoing edge at this node, or
null if it does not exist. |
protected static Edge |
Graph.firstOutEdge(Node v)
Low-level iteration support for adjacent edges.
|
Edge |
Dart.getAssociatedEdge()
Gets the edge associated with this dart.
|
Edge |
Node.getEdge(Node opposite)
Returns an edge that connects this node with the given node, if such an edge exists.
|
Edge[] |
Graph.getEdgeArray()
Returns an array containing all edges of this graph.
|
Edge |
Node.getEdgeFrom(Node source)
Returns an incoming edge that connects the given node with this node, if such an edge exists.
|
Edge |
Node.getEdgeTo(Node target)
Returns an outgoing edge that connects this node with the given node, if such an edge exists.
|
Edge |
Graph.lastEdge()
Gets the last edge in this graph.
|
Edge |
EdgeList.lastEdge()
Returns the last edge in this list, or
null when the list is empty. |
Edge |
Node.lastInEdge()
Gets the last incoming edge at this node, or
null if it does not exist. |
Edge |
Node.lastOutEdge()
Gets the last outgoing edge at this node, or
null if it does not exist. |
Edge |
Edge.nextInEdge()
Gets the successor of this edge in the list of incoming edges at its target node.
|
Edge |
Edge.nextOutEdge()
Gets the successor of this edge in the list of outgoing edges at its source node.
|
Edge |
EdgeList.popEdge()
Removes the first edge from this list and returns it.
|
Edge |
Edge.prevInEdge()
Gets the predecessor of this edge in the list of incoming edges at its target node.
|
Edge |
Edge.prevOutEdge()
Gets the predecessor of this edge in the list of outgoing edges at its source node.
|
Edge[] |
EdgeList.toEdgeArray()
Returns an edge array containing all elements of this list in the canonical order.
|
static Edge |
Triangulator.triangulatePoints(Graph result,
IDataProvider pointData,
IEdgeMap reverseEdgeMap)
Computes a triangulation of the given points.
|
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 |
---|---|
IEnumerable<Edge> |
Node.getEdges()
|
IEnumerable<Edge> |
Graph.getEdges()
|
IEnumerable<Edge> |
Node.getInEdges()
|
IEnumerable<Edge> |
Node.getOutEdges()
|
Modifier and Type | Method and Description |
---|---|
static boolean |
ShortestPaths.acyclic(Graph graph,
Node s,
double[] cost,
double[] dist,
Edge[] pred)
Solves the single-source shortest path problem for acyclic directed graphs.
|
static boolean |
ShortestPaths.bellmanFord(Graph graph,
Node s,
boolean directed,
double[] cost,
double[] dist,
Edge[] pred)
Solves the single-source shortest path problem for arbitrary graphs.
|
void |
Graph.changeEdge(Edge e,
Edge e1,
Edge e2,
GraphElementInsertion d1,
GraphElementInsertion d2)
Redefines an edge's end points and fires corresponding notification events to inform registered listeners.
|
void |
Graph.changeEdge(Edge e,
Node newSource,
Edge sourceReference,
GraphElementInsertion sourceD,
Node newTarget,
Edge targetReference,
GraphElementInsertion targetD)
Redefines an edge's end points and fires corresponding notification events to inform registered listeners.
|
void |
Graph.changeEdge(Edge e,
Node newSource,
Node newTarget)
Redefines an edge's end points and fires corresponding notification events to inform registered listeners.
|
static EdgeList |
ShortestPaths.constructEdgePath(Node s,
Node t,
Edge[] pred)
Convenience method that constructs an explicit
path of edges from the result returned by one of the
shortest paths methods defined in this class. |
static NodeList |
ShortestPaths.constructNodePath(Node s,
Node t,
Edge[] pred)
Convenience method that constructs an explicit
path of nodes from the result returned by one of the
shortest paths methods defined in this class. |
boolean |
Graph.contains(Edge e)
Whether or not this graph contains the given edge.
|
Edge |
Graph.createEdge(Node v,
Edge e1,
Node w,
Edge e2,
GraphElementInsertion d1,
GraphElementInsertion d2)
Creates a new edge in this graph to be ordered before or after a given edge and fires a corresponding notification event
to inform registered listeners.
|
static void |
ShortestPaths.dijkstra(Graph graph,
Node s,
boolean directed,
double[] cost,
double[] dist,
Edge[] pred)
Solves the single-source shortest path problem for arbitrary graphs.
|
Dart[] |
PlanarEmbedding.getDarts(Edge edge)
Returns the two darts associated with the given edge.
|
IEdgeCursor |
Node.getInEdgeCursor(Edge startEdge)
Returns an edge cursor for incoming edges at this node.
|
IEdgeCursor |
Node.getOutEdgeCursor(Edge startEdge)
Returns an edge cursor for outgoing edges at this node.
|
void |
LayoutGraphHider.hide(Edge e)
Hides the given edge from the graph.
|
void |
GraphPartitionManager.hide(Edge e)
Hides the given edge from the graph.
|
void |
Graph.hide(Edge e)
Hides the given edge from this graph.
|
void |
Graph.moveToFirst(Edge e)
Moves the given edge to the first position within the sequence of edges in this graph.
|
void |
Graph.moveToLast(Edge e)
Moves the given edge to the last position within the sequence of edges in this graph.
|
protected void |
Dfs.postTraverse(Edge edge,
Node node)
Callback method that will be invoked after the DFS has returned from the given node.
|
protected void |
Dfs.preTraverse(Edge edge,
Node node,
boolean treeEdge)
Callback method that will be invoked if the given edge will be considered the first (and only) time during the DFS.
|
void |
Graph.reInsertEdge(Edge e)
Reinserts a formerly removed edge into this graph and fires a corresponding notification event to inform registered
listeners.
|
void |
Graph.removeEdge(Edge e)
Removes the given edge from this graph and fires a corresponding notification event to inform registered listeners.
|
void |
Graph.reverseEdge(Edge e)
Reverses the given edge and fires corresponding notification events to inform registered listeners.
|
static boolean |
ShortestPaths.singleSource(Graph graph,
Node s,
boolean directed,
double[] cost,
double[] dist,
Edge[] pred)
This method solves the single-source shortest path problem for arbitrary graphs.
|
static double |
ShortestPaths.singleSourceSingleSink(Graph graph,
Node s,
Node t,
boolean directed,
double[] cost,
Edge[] pred)
This method solves the single-source single-sink shortest path problem for arbitrary graphs.
|
static void |
NodeOrders.st(Graph graph,
int[] stOrder,
Edge stEdge)
Assigns an
st -ordering to the nodes of a biconnected graph given the edge between source node s and sink
node t . |
protected void |
LayoutGraphHider.unhide(Edge e)
This method will be called whenever the hider is requested to unhide the given edge from the graph.
|
protected void |
GraphPartitionManager.unhide(Edge e)
This method will be called whenever the partition manager is requested to unhide the given edge from the graph.
|
void |
Graph.unhide(Edge e)
Unhides the given edge in this graph.
|
void |
LayoutGraphHider.unhideEdge(Edge e)
Unhides the given edge.
|
static void |
ShortestPaths.uniform(Graph graph,
Node s,
boolean directed,
double[] dist,
Edge[] pred)
Solves the single-source shortest path problem for arbitrary graphs in which each edge has a
uniform cost of
1.0 . |
Constructor and Description |
---|
Edge(Graph g,
Node v,
Edge e1,
Node w,
Edge e2,
GraphElementInsertion d1,
GraphElementInsertion d2)
Creates a new edge that belongs to the given graph.
|
EdgeList(Edge e)
Creates a list that is initialized with a single edge provided.
|
EdgeList(Edge[] a)
Creates a list that is initialized with the edges provided by the given array of edges.
|
Modifier and Type | Method and Description |
---|---|
Edge |
CopiedLayoutGraph.createEdge(Object originalEdge)
Creates an edge in the copied graph that corresponds to the given original edge.
|
Edge |
YGraphAdapter.getCopiedEdge(IEdge edge)
Yields the edge that has been created as a copy in
YGraph to represent the given edge. |
Edge |
CopiedLayoutGraph.getCopiedEdge(Object originalEdge)
Returns the copied edge that corresponds to the given original edge.
|
abstract Edge |
LayoutGraph.getOwner(IEdgeLabelLayout labelLayout)
Returns the edge to which the given
IEdgeLabelLayout belongs. |
Edge |
DefaultLayoutGraph.getOwner(IEdgeLabelLayout labelLayout) |
Edge |
CopiedLayoutGraph.getOwner(IEdgeLabelLayout labelLayout)
Returns the edge of the copied graph to which the given
IEdgeLabelLayout belongs. |
Modifier and Type | Method and Description |
---|---|
protected void |
BendConverter.addedPathForEdge(LayoutGraph graph,
Edge edge,
NodeList dummyNodes)
Adds information to newly created dummy nodes.
|
void |
ILabelLayoutFactory.addLabelLayout(Edge edge,
IEdgeLabelLayout labelLayout)
Adds the given
IEdgeLabelLayout to the given edge. |
static void |
LayoutGraphUtilities.assignReverseLayout(LayoutGraph graph,
Edge edge1,
Edge edge2)
Applies the reversed layout of the first edge to the second edge.
|
static void |
LayoutGraphUtilities.clipEdgeOnBounds(LayoutGraph graph,
Edge edge)
Clips the path of the given edge on the bounding box of the source and target points.
|
static YPointPath |
LayoutGraphUtilities.clipEdgePathOnBounds(LayoutGraph graph,
Edge edge)
Returns the path of an edge clipped on the bounding box of the source and target node.
|
IEdgeLabelLayout |
ILabelLayoutFactory.createLabelLayout(Edge edge,
YOrientedRectangle orientedBox)
Creates a new
ILabelLayout for the given edge. |
IEdgeLabelLayout |
ILabelLayoutFactory.createLabelLayout(Edge edge,
YOrientedRectangle orientedBox,
IEdgeLabelLayoutModel model,
PreferredPlacementDescriptor descriptor)
Creates a new
ILabelLayout for the given edge. |
PortConstraint |
PortConstraintConfigurator.createPortConstraintFromSketch(LayoutGraph graph,
Edge edge,
boolean source,
boolean strong)
Creates a
PortConstraint for the given edge. |
static String |
LayoutGraphUtilities.edgeLayoutString(LayoutGraph graph,
Edge edge)
Returns a
String representation of the path of the given edge. |
PortCandidateSet.IEntry |
PortCandidateSet.ICandidateMatcher.findMatchingCandidate(Edge edge,
boolean source,
double xOffset,
double yOffset,
PortDirections directionMask)
Returns the next best matching
PortCandidateSet.IEntry for the given parameters. |
PortCandidateSet.IEntry |
PortCandidateSet.ICandidateMatcher.findMatchingCandidate(Edge edge,
boolean source,
PortDirections directionMask)
Returns the next best matching
PortCandidateSet.IEntry for the given parameters. |
static Rectangle2D |
LayoutGraphUtilities.getBoundingBox(LayoutGraph graph,
Edge edge)
Returns the bounding box of the given edge.
|
protected double |
PortCandidateSet.getCost(PortCandidateSet.IEntry entry,
Edge edge,
boolean source,
double xOffset,
double yOffset)
Calculates the penalty cost for the usage of the given
entry and the given parameters. |
abstract IEdgeLabelLayout[] |
LayoutGraph.getLabelLayout(Edge edge)
Returns the layout information for all labels associated with the given edge.
|
IEdgeLabelLayout[] |
DefaultLayoutGraph.getLabelLayout(Edge edge) |
IEdgeLabelLayout[] |
CopiedLayoutGraph.getLabelLayout(Edge copiedEdge)
Returns the layout information for all labels associated with the given edge of the copied graph.
|
abstract IEdgeLayout |
LayoutGraph.getLayout(Edge edge)
Returns the layout information for the given edge.
|
IEdgeLayout |
DefaultLayoutGraph.getLayout(Edge edge) |
IEdgeLayout |
CopiedLayoutGraph.getLayout(Edge copiedEdge)
Returns the layout information for the given edge of the copied graph.
|
IEdge |
YGraphAdapter.getOriginalEdge(Edge edge)
Yields the original edge from the
original IGraph that the given edge has been created for. |
Object |
CopiedLayoutGraph.getOriginalEdge(Edge copiedEdge)
Returns the original edge that corresponds to the given copied edge.
|
YPointPath |
LayoutGraph.getPath(Edge edge)
Returns the path of an edge, including the ports.
|
static double |
LayoutGraphUtilities.getPathLength(LayoutGraph graph,
Edge edge)
Returns the length of the path of the given edge.
|
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.
|
YPointPath |
LayoutGraph.getPoints(Edge edge)
Returns the control points of an edge.
|
protected double |
PortCandidateSet.getPriority(PortCandidateSet.IEntry entry,
Edge edge,
boolean source)
Calculates the priority of the given
entry . |
YPoint |
LayoutGraph.getSourcePointAbs(Edge edge)
Returns the absolute coordinates of the source point of the given edge.
|
YPoint |
LayoutGraph.getSourcePointRel(Edge edge)
Returns the relative coordinates of the source point of the given edge.
|
static PortConstraint |
PortConstraint.getSPC(LayoutGraph graph,
Edge e)
Returns the source
PortConstraint associated with the given edge. |
YPoint |
LayoutGraph.getTargetPointAbs(Edge edge)
Returns the absolute coordinates of the target point of the given edge.
|
YPoint |
LayoutGraph.getTargetPointRel(Edge edge)
Returns the relative coordinates of the target point of the given edge.
|
static PortConstraint |
PortConstraint.getTPC(LayoutGraph graph,
Edge e)
Returns the target
PortConstraint associated with the given edge. |
static boolean |
PortConstraint.hasPC(LayoutGraph graph,
Edge e)
Checks whether or not there exist source or target
PortConstraint s associated with the given edge. |
static boolean |
PortConstraint.hasSPC(LayoutGraph graph,
Edge e)
Checks whether or not there exist source
PortConstraint s associated with the given edge. |
static boolean |
PortConstraint.hasTPC(LayoutGraph graph,
Edge e)
Checks whether or not there exist target
PortConstraint s associated with the given edge. |
static boolean |
LayoutGraphUtilities.isEdgeOutsideNodes(LayoutGraph graph,
Edge edge)
Checks whether or not the path of an edge is outside the bounding box of the source and target node.
|
boolean |
GroupingSupport.isNormalEdge(Edge edge)
Determines whether or not the given edge is a normal edge as opposed to an edge that crosses any group node bounds.
|
static void |
LayoutGraphUtilities.moveEdge(LayoutGraph graph,
Edge edge,
double dx,
double dy)
Moves all control points of the given edge by the vector
(dx,dy) . |
static boolean |
LayoutGraphUtilities.pathIntersectsRect(LayoutGraph graph,
Edge edge,
Rectangle2D rect)
Checks whether or not the path of the given edge intersects the interior of a given rectangular area.
|
static void |
LayoutGraphUtilities.removeDuplicateBends(LayoutGraph graph,
Edge edge)
Removes successive bends that have the same coordinates from the given edge.
|
void |
ILabelLayoutFactory.removeLabelLayout(Edge edge,
IEdgeLabelLayout labelLayout)
Removes the given
IEdgeLabelLayout from the given edge. |
static void |
LayoutGraphUtilities.resetPath(LayoutGraph graph,
Edge edge)
Assigns a trivial path which has no control points to the specified edge.
|
static void |
LayoutGraphUtilities.resetPath(LayoutGraph graph,
Edge edge,
boolean resetPorts)
Assigns a trivial path which has no control points to the specified edge.
|
void |
ReverseEdgesStage.reverseEdge(LayoutGraph graph,
Edge edge)
Reverses the specified edge in the specified graph.
|
static void |
LayoutGraphUtilities.roundEdgeLayout(LayoutGraph graph,
Edge edge)
Rounds the locations of the control points and ports of the given edge to integer values.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge1,
Edge edge2,
double lineDistance)
Routes two edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge1,
Edge edge2,
double lineDistance,
boolean joinEnds)
Routes two edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge1,
Edge edge2,
double lineDistance,
boolean joinEnds,
double absJoinDist)
Routes two edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge1,
Edge edge2,
double lineDistance,
boolean joinEnds,
double absJoinDist,
double relJoinDist)
Routes two edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge,
EdgeList edges,
double lineDistance)
Routes a list of edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge,
EdgeList edges,
double lineDistance,
boolean adjustE1)
Routes a list of edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge,
EdgeList edges,
double lineDistance,
boolean adjustE1,
boolean joinEnds)
Routes a list of edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge,
EdgeList edges,
double lineDistance,
boolean adjustE1,
boolean joinEnds,
double absJoinDist)
Routes a list of edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeEdgesParallel(LayoutGraph graph,
Edge edge,
EdgeList edges,
double lineDistance,
boolean adjustE1,
boolean joinEnds,
double absJoinDist,
double relJoinDist)
Routes a list of edges which are incident to the same nodes in parallel, optionally joining the end points.
|
static void |
LayoutGraphUtilities.routeSelfLoop(LayoutGraph graph,
Edge edge)
Routes a self-loop.
|
void |
LayoutGraph.setEndPointsAbs(Edge edge,
YPoint source,
YPoint target)
Specifies the two end points of the given edge in absolute coordinates.
|
void |
DefaultLayoutGraph.setLabelLayout(Edge edge,
IEdgeLabelLayout[] layout)
Specifies the layout information for all associated labels of the given edge.
|
void |
DefaultLayoutGraph.setLayout(Edge edge,
IEdgeLayout layout)
Specifies the layout information for the given edge.
|
void |
LayoutGraph.setPath(Edge edge,
YList path)
Sets the path of the given edge.
|
void |
LayoutGraph.setPath(Edge edge,
YPointPath path)
Sets the path of the given edge.
|
void |
LayoutGraph.setPoints(Edge edge,
YList points)
Sets the control points of the given edge.
|
void |
LayoutGraph.setPoints(Edge edge,
YPointPath points)
Sets the control points of the given edge.
|
void |
LayoutGraph.setSourcePointAbs(Edge edge,
YPoint point)
Specifies the absolute coordinates of the source point of the given edge.
|
void |
LayoutGraph.setSourcePointRel(Edge edge,
YPoint point)
Specifies the relative coordinates of the source point of the given edge.
|
void |
LayoutGraph.setTargetPointAbs(Edge edge,
YPoint point)
Specifies the absolute coordinates of the target point of the given edge.
|
void |
LayoutGraph.setTargetPointRel(Edge edge,
YPoint point)
Specifies the relative coordinates of the target point of the given edge.
|
Modifier and Type | Method and Description |
---|---|
Edge |
IItemFactory.createDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a dummy
Edge using the given data. |
Edge |
IItemFactory.createGroupBorderEdge(Node source,
Node target)
|
Edge |
IItemFactory.createGroupNodeConnectorEdge(Node groupNode1,
Node groupNode2,
Edge representative)
|
Edge |
IItemFactory.createRecursiveDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a dummy edge that belongs to a recursive
Edge . |
Edge |
IItemFactory.createRedirectedGroupEdge(Node newSource,
Node newTarget,
Edge groupEdge)
|
Edge |
IItemFactory.createReverseDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a reversed dummy
Edge using the given data. |
Edge |
IItemFactory.createSameLayerProxy(ILayer layer,
Edge edge,
Node toProxy)
|
Edge |
IItemFactory.destroyProxyNode(Node proxyNode)
Destroys a proxy
Node created using IItemFactory.createProxyNode(Edge, boolean, SwimlaneDescriptor) for the drawing
phase. |
Edge |
IItemFactory.destroySameLayerProxy(Edge edge)
Destroys a same-layer
Edge proxy created using IItemFactory.createSameLayerProxy(ILayer, Edge, Node) . |
Edge |
IItemFactory.destroySameLayerSwitchProxy(Node node)
Destroys a same-layer switch proxy
Node created using IItemFactory.createSameLayerSwitchProxy(ILayer, Edge) . |
Edge |
INodeData.getAssociatedEdge()
|
Edge |
IEdgeData.getAssociatedEdge()
|
Edge |
AbstractPortConstraintOptimizer.SameLayerData.getOriginalEdge(Node sameLayerDummy)
Returns the original (same-layer) edge associated with the given dummy
Node . |
Modifier and Type | Method and Description |
---|---|
void |
AbstractPortConstraintOptimizer.SameLayerData.addDummyNode(Node sameLayerDummy,
Edge originalEdge)
Adds a given dummy
Node to this AbstractPortConstraintOptimizer.SameLayerData instance and associates it with the given original
(same-layer) Edge . |
void |
ILayer.addSameLayerEdge(Edge edge)
|
default Node |
IItemFactory.createBendNode(ILayer layer,
Edge edge)
Creates a bend
Node for the given Edge in the given ILayer and assigns it to the given SwimlaneDescriptor
instance. |
Node |
IItemFactory.createBendNode(ILayer layer,
Edge edge,
SwimlaneDescriptor laneDescriptor)
Creates a bend
Node for the given Edge in the given ILayer and assigns it to the given SwimlaneDescriptor
instance. |
default INodeData |
IItemFactory.createBendNodeData(Node node,
Edge edge)
|
INodeData |
IItemFactory.createBendNodeData(Node node,
Edge edge,
SwimlaneDescriptor laneDescriptor)
|
Node |
IItemFactory.createConnectorProxyForGroup(Node groupNode,
Object groupId,
ILayer layer,
Edge edge)
|
Node |
IItemFactory.createContentConnectorProxyForGroup(Node groupNode,
Object groupId,
ILayer layer,
Edge e)
Creates a dummy node that mimics a connector to a group node from a descendant.
|
Node |
IItemFactory.createDistanceNode(ILayer layer,
Rectangle2D size,
Edge[] edges)
|
Edge |
IItemFactory.createDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a dummy
Edge using the given data. |
Edge |
IItemFactory.createGroupNodeConnectorEdge(Node groupNode1,
Node groupNode2,
Edge representative)
|
IEdgeData |
IItemFactory.createNormalEdgeData(Edge edge)
|
default Node |
IItemFactory.createProxyNode(Edge edge,
boolean source)
Creates a proxy
Node for an Edge during the drawing phase, changing the Edge to end/start at the
proxy and assigns it to a SwimlaneDescriptor instance. |
Node |
IItemFactory.createProxyNode(Edge edge,
boolean source,
SwimlaneDescriptor laneDescriptor)
Creates a proxy
Node for an Edge during the drawing phase, changing the Edge to end/start at the
proxy and assigns it to a SwimlaneDescriptor instance. |
INodeData |
IItemFactory.createProxyNodeData(Node node,
Node proxy,
Edge edge)
|
Edge |
IItemFactory.createRecursiveDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a dummy edge that belongs to a recursive
Edge . |
Node |
IItemFactory.createRecursiveEdgeDummy(ILayer layer,
Edge edge,
SwimlaneDescriptor laneDescriptor)
|
INodeData |
IItemFactory.createRecursiveEdgeNodeData(Node node,
Edge edge,
SwimlaneDescriptor laneDescriptor)
|
IEdgeData |
IItemFactory.createRecursiveSameLayerEdgeData(Edge edge,
IEdgeData originalEdgeData,
boolean isUpper)
|
Edge |
IItemFactory.createRedirectedGroupEdge(Node newSource,
Node newTarget,
Edge groupEdge)
|
Edge |
IItemFactory.createReverseDummyEdge(Node newSource,
Node newTarget,
Edge oldEdge,
boolean sourceEnd,
boolean targetEnd)
Creates a reversed dummy
Edge using the given data. |
IEdgeData |
IItemFactory.createSameLayerEdgeData(Edge edge)
|
Edge |
IItemFactory.createSameLayerProxy(ILayer layer,
Edge edge,
Node toProxy)
|
default Node |
IItemFactory.createSameLayerSideProxy(ILayer inLayer,
Node forNode,
Edge edge)
|
Node |
IItemFactory.createSameLayerSideProxy(ILayer inLayer,
Node forNode,
Edge edge,
SwimlaneDescriptor sld)
|
Node |
IItemFactory.createSameLayerSwitchProxy(ILayer layer,
Edge edge)
|
IEdgeData |
IItemFactory.createSelfLoopEdgeData(Edge edge)
|
Edge |
IItemFactory.destroySameLayerProxy(Edge edge)
Destroys a same-layer
Edge proxy created using IItemFactory.createSameLayerProxy(ILayer, Edge, Node) . |
IEdgeData |
ILayoutDataProvider.getEdgeData(Edge edge)
|
protected double |
SelfLoopCalculator.getMinimumDistance(LayoutGraph graph,
Edge edge)
Returns the minimum length between two edges associated with the given edge.
|
protected double |
SelfLoopCalculator.getMinimumFirstSegmentLength(LayoutGraph graph,
Edge edge)
Returns the minimum length of the first segment of the given edge.
|
protected double |
SelfLoopCalculator.getMinimumLastSegmentLength(LayoutGraph graph,
Edge edge)
Returns the minimum length of the last segment of the given edge.
|
protected double |
SelfLoopCalculator.getMinimumOctilinearSegmentLength(LayoutGraph graph,
Edge edge)
Returns the minimum octilinear segment length of the given edge.
|
protected double |
WeightedLayerer.getWeight(Edge edge)
Returns the edge weight of the given edge using the weight based cycle removal heuristic.
|
EdgeList |
IItemFactory.insertEdge(Edge edge)
|
protected boolean |
SelfLoopCalculator.isOctilinearEdge(LayoutGraph graph,
Edge edge)
Returns whether or not the given edge is octilinear.
|
void |
IItemFactory.registerSameLayerEdge(Edge edge)
|
void |
IEdgeReverser.reverse(LayoutGraph graph,
ILayoutDataProvider ldp,
Edge edge)
Reverses a given edge which points to the wrong direction.
|
void |
IItemFactory.setDirectlyConnectSameLayerEdge(Edge sameLayerEdge)
|
IEdgeData |
IItemFactory.setTemporaryEdgeGroups(Edge edge,
Object sgId,
Object tgId)
|
IEdgeData |
IItemFactory.setTemporaryEdgeThickness(Edge edge,
double thickness)
|
IEdgeData |
IItemFactory.setTemporaryPortConstraint(Edge edge,
boolean source,
PortConstraint pc)
|
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractMISLabeling.foundEdgeOverlap(LabelCandidate labelCandidate,
Edge edge,
LineSegment eSegment)
Indicates that an overlap between a
LabelCandidate and an Edge of the input graph has been found. |
protected void |
AbstractMISLabeling.foundLabelOverlap(LabelCandidate candidate1,
LabelCandidate candidate2,
Edge edge)
Indicates that an overlap between two
LabelCandidate s has been found. |
Modifier and Type | Method and Description |
---|---|
Edge |
IElementFactory.createConnectorEdge(LayoutContext context,
Node connector,
Node opposite,
Object origEdgeId,
boolean atTarget)
Callback method for creating an edge of type
EdgeType.CONNECTOR . |
Edge |
DefaultElementFactory.createConnectorEdge(LayoutContext context,
Node connector,
Node opposite,
Object origEdgeId,
boolean atTarget) |
Edge |
LayoutContext.createEdge(Node source,
Node target,
Object sameDataElementId)
All methods of the
IElementFactory have to use this method to create an
edge. |
Edge |
IElementFactory.createProxyEdge(LayoutContext context,
Node proxyNode,
Node opposite,
Object replacingEdgeId,
Object origNodeId)
Callback method for creating an edge of type
EdgeType.PROXY . |
Edge |
DefaultElementFactory.createProxyEdge(LayoutContext context,
Node proxyNode,
Node opposite,
Object replacingEdgeId,
Object origNodeId) |
Edge |
IElementFactory.createProxyReferenceEdge(LayoutContext context,
Node proxyReference,
Node opposite,
Object referencingCopyId)
Callback method for creating an edge of type
EdgeType.PROXY_REFERENCE . |
Edge |
DefaultElementFactory.createProxyReferenceEdge(LayoutContext context,
Node proxyReference,
Node opposite,
Object referencingCopyId) |
Edge |
LayoutContext.getOriginalEdge(Object id)
Returns the edge of the input graph with the given ID or
null if there is no such edge. |
Edge |
LayoutContext.getPageEdge(Object id)
Returns the edge of a page graph (a graph that represents the result of the multi-page layout) with the given ID or
null
if there is no such edge. |
Edge |
IEdgeInfo.getRepresentedEdge()
Gets the original edge associated with this
IEdgeInfo . |
Modifier and Type | Method and Description |
---|---|
void |
LayoutContext.addEdgeLabel(IEdgeLabelLayout label,
Edge labeledElement)
Adds a label to a given edge.
|
IEdgeInfo |
MultiPageLayoutResult.getEdgeInfo(Edge edge) |
IEdgeInfo |
LayoutContext.getEdgeInfo(Edge edge) |
IEdgeInfo |
IElementInfoManager.getEdgeInfo(Edge edge)
Returns the edge information object of the given edge.
|
boolean |
LayoutContext.removeEdgeLabel(IEdgeLabelLayout label,
Edge labeledElement)
Removes a label from a given edge.
|
Modifier and Type | Method and Description |
---|---|
void |
InteractiveOrganicLayout.setPreferredEdgeLength(Edge edge,
double newEdgeLength)
Schedules an update for the preferred length of the given edge.
|
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 |
---|---|
Edge |
PathSearchContext.getCurrentEdge()
Gets the edge that is currently routed.
|
Edge |
Path.getEdge()
Gets the edge for which this path was calculated.
|
Edge |
EdgeInfo.getEdge()
Gets the edge whose route is described by this
EdgeInfo instance. |
Edge |
EdgeCellInfo.getEdge()
Gets the edge that is routed within the
partition cell . |
Edge |
AbstractSegmentInfo.getEdge()
Gets the edge to which the segment of this info belongs.
|
Modifier and Type | Method and Description |
---|---|
EdgeInfo |
PathSearchResult.getEdgeInfo(Edge edge)
Returns an
EdgeInfo for the given edge. |
protected EdgeLayoutDescriptor |
EdgeRouter.getEdgeLayoutDescriptor(Edge edge)
Returns the
EdgeLayoutDescriptor instance for a given edge that is provided by a IDataProvider which is
registered with the graph with key EdgeRouter.EDGE_LAYOUT_DESCRIPTOR_DPKEY . |
Path |
PathSearch.getFinalizedPath(Edge edge)
Returns the path for the given edge if it has already been finalized.
|
Path |
PathSearchResult.getPath(Edge edge)
Returns the previously registered path found for the edge.
|
protected boolean |
EdgeRouter.isAffected(Edge edge,
Graph graph)
Returns whether or not a given edge is selected.
|
protected void |
PathSearchContext.setCurrentEdge(Edge value)
Sets the edge that is currently routed.
|
void |
PathSearchResult.setPath(Edge edge,
Path path)
Specifies a found path for an edge.
|
Constructor and Description |
---|
AbstractSegmentInfo(Edge edge,
int segmentIndex,
Direction direction,
Interval locationRange,
Interval minExtension,
Interval maxExtension)
Creates a new instance of
AbstractSegmentInfo . |
AbstractSegmentInfo(Edge edge,
int segmentIndex,
LineSegment segment)
Creates a new instance of
AbstractSegmentInfo using a line segment to describe the edge segment. |
CellSegmentInfo(Edge edge,
int segmentIndex,
Direction direction,
Interval locationRange,
Interval minExtension,
Interval maxExtension,
PartitionCell cell)
Creates a new
CellSegmentInfo instance. |
EdgeCellInfo(Edge edge,
PartitionCell cell,
OrthogonalInterval enterInterval,
OrthogonalInterval exitInterval,
Direction enterDirection,
Direction exitDirection,
int enterSegmentNo)
Creates a new
EdgeCellInfo instance. |
Path(Edge edge,
List<Object> entrances,
double cost)
Creates a new instance of
Path for the given edge, cell entrances and cost. |
SegmentInfo(Edge edge,
int segmentIndex,
Direction direction,
Interval locationRange,
Interval minExtension,
Interval maxExtension,
List<Object> cellSegmentInfos)
Creates a new instance of
SegmentInfo with the given information. |
SegmentInfo(Edge edge,
int segmentIndex,
LineSegment segment)
Creates a new instance of
SegmentInfo using a LineSegment to describe the edge segment. |
Modifier and Type | Method and Description |
---|---|
void |
TreeLayout.SubtreeShape.addEdgeSegments(LayoutGraph graph,
Edge edge)
Adds all edge segments of the given edge to this
TreeLayout.SubtreeShape instance. |
protected void |
DefaultPortAssignment.assignChildEdgeSourcePort(LayoutGraph graph,
Node node,
Edge edge,
int index)
Assigns relative coordinates to the source port of the outgoing edge to a child of the given node.
|
protected void |
DefaultPortAssignment.assignParentEdgeTargetPort(LayoutGraph graph,
Node node,
Edge edge)
Assigns relative coordinates to the target port of the incoming edge from the parent of the given node.
|
protected void |
DefaultNodePlacer.calculateParentConnector(LayoutGraph graph,
Node localRoot,
INodeLayout rootLayout,
TreeLayout.SubtreeShape subtreeShape,
Edge parentEdge,
IEdgeLayout parentEdgeLayout,
byte direction)
Calculates the bends for the connector to the parent node.
|
protected void |
DefaultNodePlacer.calculateSlopedSourceEdgeLayout(INodeLayout rootLayout,
TreeLayout.SubtreeShape childShape,
Edge edge,
double childForkCoordinate,
double rootForkCoordinate)
Calculates the routing of the source side of the edge to the given child node.
|
protected void |
DefaultNodePlacer.calculateSourceEdgeLayout(INodeLayout rootLayout,
TreeLayout.SubtreeShape childShape,
Edge edge)
Calculates the routing of the source side of the edge to the given child node.
|
protected void |
DefaultNodePlacer.calculateTargetEdgeLayout(INodeLayout rootLayout,
TreeLayout.SubtreeShape childShape,
Edge edge)
Calculates the routing of the target side of the edge to the given child node.
|
protected YPoint |
AbstractRotatableNodePlacer.getSourcePointAbs(Edge edge)
Returns the absolute source point of the given edge depending on the rotation of this
INodePlacer . |
protected PortConstraint |
DefaultPortAssignment.getSourcePortConstraint(LayoutGraph graph,
Edge edge,
int index)
Retrieves the source
PortConstraint for the given edge. |
protected PortConstraint |
DefaultPortAssignment.getTargetPortConstraint(LayoutGraph graph,
Edge edge)
Retrieves the target
PortConstraint for the given edge. |