| allPairsShortestPath (LayoutGraph, boolean, IMapper<LayoutEdge,number>) | in
LayoutGraphAlgorithms | Computes the shortest paths between all pairs of nodes in a graph with arbitrary edge costs. |
| allPaths (LayoutGraph, LayoutNode, LayoutNode, boolean, function(IList<LayoutEdge>):boolean?) | in
LayoutGraphAlgorithms | Returns all simple directed or undirected paths between two given nodes as a special cursor that calculates the next path in the sequence, only when needed. |
| allUnweightedShortestPaths (LayoutGraph, LayoutNode, IEnumerable<LayoutNode>, boolean, IEnumerable<LayoutEdge>, IEnumerable<LayoutNode>, number?) | in
LayoutGraphAlgorithms | Computes all nodes and edges that belong to the shortest path from a specified source node to a set of sinks in the graph, ensuring the path does not exceed a given distance. |
| biconnectedComponents (LayoutGraph, IMapper<LayoutEdge,number>?, IMapper<LayoutNode,boolean>?) | in
LayoutGraphAlgorithms | Calculates the biconnected components and articulation points of the specified undirected graph, and returns the biconnected components. |
| chainSubstructures (LayoutGraph, number, IMapper<LayoutNode,any>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Identifies and returns a collection of Substructure instances representing the chains within the specified graph that contain at least minimumSize nodes. |
| closenessCentrality (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the closeness centrality for each node in the specified graph. |
| cycleSubstructures (LayoutGraph, number, IMapper<LayoutNode,any>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Identifies and returns a collection of Substructure instances representing the cycles within the specified graph that contain at least minimumSize nodes. |
| delaunayTriangulation (LayoutGraph, IMapper<LayoutNode,Point>, IMapper<LayoutEdge,LayoutEdge>) | in
LayoutGraphAlgorithms | Computes a Delaunay triangulation of the given points. |
| dfs (LayoutGraph, LayoutNode, boolean?, boolean?, function(LayoutNode, number):void?, function(LayoutNode, number, number):void?, function(LayoutEdge, LayoutNode, boolean):void?, function(LayoutEdge, LayoutNode):void?, function(LayoutNode):void?) | in
LayoutGraphAlgorithms | Executes a depth-first search (DFS) on the specified graph starting from the given node. |
| diameter (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the diameter of the specified graph. |
| edgeBetweenness (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the betweenness centrality for each edge in the specified graph. |
| edgeBetweennessClustering (LayoutGraph, IMapper<LayoutNode,number>, boolean, number, number, IMapper<LayoutEdge,number>) | in
LayoutGraphAlgorithms | Partitions the graph into clusters using edge betweenness centrality. |
| findCycleEdges (LayoutGraph, IMapper<LayoutEdge,boolean>, IMapper<LayoutEdge,number>?, boolean?) | in
LayoutGraphAlgorithms | Identifies and marks the edges of a given graph whose removal or reversal would transform the graph into an acyclic structure, while attempting to minimize the associated costs of the marked edges. |
| findCycleEdgesDfs (LayoutGraph, IMapper<LayoutEdge,boolean>) | in
LayoutGraphAlgorithms | Identifies and marks the edges of a given graph whose removal or reversal would render the graph acyclic, utilizing a depth-first search (DFS) approach. |
| graphCentrality (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the graph centrality for each node in the specified graph. |
| kShortestPaths (LayoutGraph, IMapper<LayoutEdge,number>, LayoutNode, LayoutNode, number, boolean?) | in
LayoutGraphAlgorithms | Computes the k shortest paths connecting a pair of nodes in a directed graph with non-negative edge costs. |
| labelPropagation (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutNode,number>?, IMapper<LayoutNode,number>?, IMapper<LayoutEdge,number>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Detects communities in the specified input graph using the label propagation algorithm. |
| longestPath (LayoutGraph, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the longest directed path in a given acyclic weighted graph. |
| longestPaths (LayoutGraph, LayoutNode, IMapper<LayoutEdge,number>) | in
LayoutGraphAlgorithms | Calculates the longest path from a given node to all other nodes in a given directed acyclic graph. |
| louvainModularity (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Finds communities in the specified input graph using the Louvain modularity method. |
| maximumFlow (LayoutGraph, LayoutNode, LayoutNode, IMapper<LayoutEdge,number>, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Solves a maximum flow problem using the preflow-push algorithm. |
| maximumFlowMinimumCut (LayoutGraph, LayoutNode, LayoutNode, IMapper<LayoutEdge,number>, IMapper<LayoutEdge,number>?, IMapper<LayoutNode,boolean>?) | in
LayoutGraphAlgorithms | Solves a maximum flow problem using the preflow-push algorithm and identifies the minimum cut set. |
| minimumCostFlow (LayoutGraph, IMapper<LayoutEdge,number>, IMapper<LayoutEdge,number>, IMapper<LayoutNode,number>, IMapper<LayoutEdge,number>?, IMapper<LayoutNode,number>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Solves a minimum cost flow problem using a capacity scaling algorithm. |
| minimumSpanningTree (LayoutGraph, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Calculates the minimum spanning tree (MST) for the given undirected connected graph. |
| modularity (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the modularity of a given graph based on the provided community partition. |
| nodeBetweenness (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the betweenness centrality for each node in the specified graph. |
| nodeEdgeBetweenness (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the betweenness centrality for each node and edge in the specified graph. |
| pageRank (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutNode,number>?, IMapper<LayoutNode,number>?, IMapper<LayoutEdge,number>?, IMapper<LayoutEdge,number>?, number?, number?) | in
LayoutGraphAlgorithms | Computes the PageRank values for all nodes in the specified graph based on their attached edges. |
| shortestPath (LayoutGraph, LayoutNode, LayoutNode, boolean?, IMapper<LayoutEdge,number>?, IMapper<LayoutNode,number>?) | in
LayoutGraphAlgorithms | Computes the shortest path from a single source node to a single sink node in a graph. |
| simplexRankAssignment (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutEdge,number>, IMapper<LayoutEdge,number>, TimeSpan?, IMapper<LayoutEdge,boolean>?, LayoutNode?, boolean?) | in
LayoutGraphAlgorithms | Solves the rank assignment problem for a directed acyclic graph (DAG) using the simplex method, with an optional time limit for the algorithm's execution. |
| singleSourceShortestPath (LayoutGraph, LayoutNode, boolean?, IMapper<LayoutEdge,number>?, IMapper<LayoutNode,number>?, IMapper<LayoutNode,yfiles.layout.LayoutEdge|null>?) | in
LayoutGraphAlgorithms | Computes the shortest path distances from a single source node to all other nodes in a graph. |
| starSubstructures (LayoutGraph, number, IMapper<LayoutNode,any>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Identifies and returns a collection of Substructure instances representing the star structures within the specified graph that contain at least minimumSize nodes. |
| stOrder (LayoutGraph, LayoutEdge?) | in
LayoutGraphAlgorithms | Assigns an st-ordering to the nodes of a biconnected graph, given an edge between the source node s and the sink node t. |
| treeSubstructures (LayoutGraph, number, IMapper<LayoutNode,any>?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Identifies and returns a collection of Substructure instances representing the trees within the specified graph that contain at least minimumSize nodes. |
| weightCentrality (LayoutGraph, boolean?, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the weight centrality for the nodes in the specified graph. |
| getDarts (LayoutEdge) | in
PlanarEmbedding | Returns the two darts associated with the given edge. |
| getCrossingCost (LayoutEdge, LayoutEdge, HierarchicalLayoutContext) | in
DefaultSequencer | Returns the cost of an edge crossing between the two given edges. |
| getOriginalEdge (LayoutEdge, HierarchicalLayoutContext) | in
HierarchicalLayout | Returns the corresponding original edge instance for a given edge. |
| getEdgeContext (LayoutEdge) | in
HierarchicalLayoutContext | Returns the HierarchicalLayoutEdgeContext instance associated with the given LayoutEdge. |
| addSameLayerEdge (LayoutEdge) | in
HierarchicalLayoutLayer | Adds a same-layer LayoutEdge to this layer. |
| createBendNode (LayoutEdge, HierarchicalLayoutLayer?, LayoutGridColumn?, boolean?) | in
ItemFactory | Creates a bend LayoutNode for the given LayoutEdge in the given layer and assigns it to the given LayoutGridColumn. |
| createConnectorProxyForGroup (LayoutNode, HierarchicalLayoutLayer, LayoutEdge, boolean?) | in
ItemFactory | Creates a helper LayoutNode that mimics a connector to a group LayoutNode. |
| createEdgeGroupingConnectorEdge (LayoutNode, LayoutNode, LayoutEdge) | in
ItemFactory | Creates a connector edge between two edge group helper nodes (createEdgeGroupNode). |
| createGroupedEdgeContext (LayoutEdge, any, any) | in
ItemFactory | Creates a HierarchicalLayoutEdgeContext instance that specifies grouping IDs and associates it with the given edge. |
| createHelperEdge (LayoutNode, LayoutNode, LayoutEdge, boolean, boolean, boolean?, boolean?) | in
ItemFactory | Creates a helper LayoutEdge for the HierarchicalLayout, using context information of the given old edge. |
| createNormalEdgeContext (LayoutEdge) | in
ItemFactory | Creates a HierarchicalLayoutEdgeContext instance for a given normal LayoutEdge and associates it with the edge. |
| createSameLayerProxyEdge (HierarchicalLayoutLayer, LayoutEdge, LayoutNode) | in
ItemFactory | Creates a same-layer edge proxy connecting a newly created proxy node and a given proxy LayoutNode in the given layer. |
| createSameLayerSideProxy (HierarchicalLayoutLayer, LayoutNode, LayoutEdge, LayoutGridColumn?) | in
ItemFactory | Creates a side proxy node (SAME_LAYER_SIDE_PROXY) for a same-layer edge during the drawing phase that ends at the side of a node. |
| createSameLayerSwitchProxy (HierarchicalLayoutLayer, LayoutEdge) | in
ItemFactory | Creates a same-layer switch proxy LayoutNode (switching between two same-layer LayoutEdges on two different sides of the layer); the new node will be of type SAME_LAYER_CENTER_NODE. |
| createSideProxyNode (LayoutEdge, boolean, LayoutGridColumn?) | in
ItemFactory | Creates a side proxy LayoutNode (SIDE_PROXY) for an edge during the drawing phase, changing the LayoutEdge to end/start at the new proxy and assigns it to a LayoutGridColumn instance. |
| destroySameLayerProxyEdge (LayoutEdge) | in
ItemFactory | Destroys a same-layer LayoutEdge proxy created using createSameLayerProxyEdge, also removing the proxy node that was created in that method call. |
| insertEdge (LayoutEdge) | in
ItemFactory | Inserts a same-layer LayoutEdge or an LayoutEdge that may span multiple layers into the data structure and returns the resulting list of LayoutEdges that has been created if this edge spans multiple layers, null otherwise. |
| registerSameLayerEdge (LayoutEdge) | in
ItemFactory | Registers an LayoutEdge as a same-layer LayoutEdge appropriately into all data structures. |
| setDirectlyConnectSameLayerEdge (LayoutEdge) | in
ItemFactory | Converts a same-layer LayoutEdge to an LayoutEdge of type DIRECT_SAME_LAYER_EDGE. |
| selectAfterSequencingAtNode (LayoutNode, function(LayoutEdge, LayoutEdge):number, function(LayoutEdge, LayoutEdge):number, LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | Assigns new temporary port constraints to a given node of the graph after the order of the nodes in each layer has been determined. |
| selectAfterSequencingWithOrders (function(LayoutEdge, LayoutEdge):number, function(LayoutEdge, LayoutEdge):number, LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | Assigns new temporary port constraints after the order of the nodes in each layer has been determined. |
| addHelperNode (LayoutNode, LayoutEdge) | in
PortCandidateSelectorSameLayerData | Adds a given helper LayoutNode to this PortCandidateSelectorSameLayerData instance and associates it with the given original (same-layer) LayoutEdge. |
| getWeight (LayoutEdge) | in
WeightedLayerAssigner | Returns the edge weight of the given edge using the weight based cycle removal heuristic. |
| addedPathForEdge (LayoutGraph, LayoutEdge, YList<LayoutNode>) | in
BendSubstitutionStage | Adds information to newly created proxy nodes. |
| routeInterEdges (LayoutGraph, IEnumerable<LayoutEdge>) | in
ComponentLayout | Reroutes the given inter-edges using the current edge routing algorithm. |
| addLayoutData (LayoutData<LayoutNode,LayoutEdge,LayoutNodeLabel,LayoutEdgeLabel>) | in
ContextModificationStage | Adds the specified layout data to be temporarily applied by this stage. |
| addReplacementMap (EdgeDataKey<T>, IMapper<LayoutEdge,T>) | in
ContextModificationStage | Adds the specified key to the data keys whose associated data is temporarily replaced by this stage. |
| getReference (LayoutEdge, LayoutAnchoringPolicy) | in
LayoutAnchoringStage | Gets the reference bounds for an edge based on the specified LayoutAnchoringPolicy. |
| addBend (LayoutEdge, number, number, LayoutBend?, RelativePosition?) | in
LayoutGraph | Creates a new bend point for the given edge with the specified coordinates. |
| addLabel (LayoutEdge, number, number) | in
LayoutGraph | Creates a new label for the specified edge with the given dimensions. |
| addLabel (LayoutEdge, IOrientedRectangle) | in
LayoutGraph | Creates a new label for the specified edge with the given layout. |
| applyLayout (ILayoutAlgorithm, LayoutData<LayoutNode,LayoutEdge,LayoutNodeLabel,LayoutEdgeLabel>?) | in
LayoutGraph | Runs an ILayoutAlgorithm synchronously on the given LayoutGraph, applying the given layoutData. |
| changeEdge (LayoutEdge, LayoutNode, LayoutNode, LayoutEdge?, RelativePosition?, LayoutEdge?, RelativePosition?) | in
LayoutGraph | Redefines the endpoints of the specified edge, changing its source and target nodes. |
| contains (LayoutEdge) | in
LayoutGraph | Determines whether this graph contains the specified edge. |
| createCompositeLayoutData (LayoutData<LayoutNode,LayoutEdge,LayoutNodeLabel,LayoutEdgeLabel>) | in
LayoutGraph | Returns an instance of CompositeLayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that combines the given instances of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel>. |
| createCopy (LayoutGraph, IEnumerable<LayoutNode>?, IEnumerable<LayoutEdge>?, boolean?) | in
LayoutGraph | Creates a new LayoutGraph as a (partial) copy of the specified graph. |
| createEdge (LayoutNode, LayoutNode, LayoutEdge?, RelativePosition?, LayoutEdge?, RelativePosition?) | in
LayoutGraph | Creates a new edge between the specified source and target nodes. |
| disposeEdgeDataMap (IMapper<LayoutEdge,TValue>) | in
LayoutGraph | Informs the graph that the specified IMapper<K,V> is no longer needed. |
| getBounds (IEnumerable<LayoutNode>?, IEnumerable<LayoutEdge>?, boolean?, boolean?, boolean?) | in
LayoutGraph | Returns the bounds of the graph, optionally considering the specified nodes and edges, including node labels, edge labels, or node margins. |
| reinsert (LayoutEdge) | in
LayoutGraph | Reinserts a previously removed edge back into this graph. |
| remove (LayoutEdge) | in
LayoutGraph | Removes the specified edge from this graph. |
| reverseEdge (LayoutEdge) | in
LayoutGraph | Reverses the specified edge. |
| sortEdges (function(LayoutEdge, LayoutEdge):number) | in
LayoutGraph | Sorts the list of LayoutEdge objects in this graph. |
| sortEdges (function(LayoutEdge, LayoutEdge):number, function(LayoutEdge, LayoutEdge):number) | in
LayoutGraph | Sorts incoming and outgoing edges at each node of the graph. |
| getOriginalEdge (LayoutEdge) | in
LayoutGraphAdapter | Returns the original edge that corresponds to the given layout graph edge. |
| addItemData (EdgeDataKey<TValue>, IMapper<LayoutEdge,TValue>) | in
LayoutGraphContext | Registers data for individual edges at the graph with the specified EdgeDataKey<TValue>. |
| addItemData (EdgeDataKey<TValue>, function(LayoutEdge):TValue, function(LayoutEdge, TValue):void?) | in
LayoutGraphContext | Registers data for individual edges at the graph with the specified EdgeDataKey<TValue>. |
| pushLayer (LayoutData<LayoutNode,LayoutEdge,LayoutNodeLabel,LayoutEdgeLabel>?) | in
LayoutGraphContext | Pushes a new layer onto the context, optionally applying layout data. |
| getCopiedEdge (LayoutEdge) | in
LayoutGraphCopyData | Returns the copied edge that corresponds to the specified original edge. |
| getOriginalEdge (LayoutEdge) | in
LayoutGraphCopyData | Returns the original edge that corresponds to the specified copied edge. |
| isNormalEdge (LayoutEdge) | in
LayoutGraphGrouping | Determines whether the given edge is a normal edge, as opposed to an edge that crosses any group node boundaries. |
| hide (LayoutEdge) | in
LayoutGraphHider | Hides the specified edge. |
| hideEdges (IEnumerable<LayoutEdge>) | in
LayoutGraphHider | Hides the specified collection of edges. |
| unhide (LayoutEdge) | in
LayoutGraphHider | Unhides the specified edge. |
| unhideEdges (IEnumerable<LayoutEdge>) | in
LayoutGraphHider | Unhides the specified collection of edges. |
| sortInEdges (function(LayoutEdge, LayoutEdge):number) | in
LayoutNode | Sorts the incoming edges at this node according to the specified comparison function. |
| sortOutEdges (function(LayoutEdge, LayoutEdge):number) | in
LayoutNode | Sorts the outgoing edges at this node according to the specified comparison function. |
| routeInterEdges (LayoutGraph, IEnumerable<LayoutEdge>) | in
RecursiveGroupLayout | Reroutes the given inter-edges using the current edge routing algorithm. |
| createCopiedToOriginalEdgeWrapper (IMapper<LayoutEdge,TValue>) | in
StructureGraphAdapter | Creates an IMapper<K,V> that delegates its operations to the provided IMapper<K,V> for items within the context of the IGraph, but translates requests so they can be made using the corresponding original edges. |
| createOriginalEdgeList (IEnumerable<LayoutEdge>) | in
StructureGraphAdapter | Creates an IEnumerable<T> of original IEdge instances by mapping the provided copied LayoutEdge instances from the structureGraph to their corresponding originals in the originalGraph. |
| getOriginalEdge (LayoutEdge) | in
StructureGraphAdapter | Retrieves the original edge from the originalGraph that corresponds to the specified copied edge. |
| getEdgeId (LayoutEdge) | in
MultiPageLayoutContext | Gets the unique ID of the associated edge. |
| getEdgeType (LayoutEdge) | in
MultiPageLayoutContext | Gets the type of the associated edge. |
| getRepresentedEdge (LayoutEdge) | in
MultiPageLayoutContext | Gets the original edge associated with this info. |
| getOriginalItem (LayoutEdge, MultiPageLayoutResult) | in
MultiPageLayoutData | Returns an edge of the original input graph that corresponds to the provided edge of the LayoutGraph returned by the MultiPageLayout. |
| createAreaOutline (LayoutGraph, IEnumerable<LayoutNode>, IEnumerable<LayoutEdge>) | in
ClearAreaLayout | Creates the outline that describes the shape of the given nodes and edges. |
| routeEdgesBetweenFixedElements (LayoutGraph, IEnumerable<LayoutEdge>) | in
PartialLayout | This method is called during the layout process and routes all partial edges that connect two fixed elements. |
| routeInterEdges (LayoutGraph, IEnumerable<LayoutEdge>) | in
PartialLayout | This method is called during the layout process and routes all inter-edges. |
| getEdgeDescriptor (LayoutEdge) | in
EdgeRouter | Returns the EdgeRouterEdgeDescriptor instance for a given edge that is defined via edgeDescriptors. |
| hideMultiEdges (YList<LayoutEdge>, LayoutGraph) | in
ParallelEdgeRouter | Hides and stores the given list of multi-edges. |
| routeEdges (LayoutGraph, IMapper<LayoutEdge,YList<LayoutEdge>>) | in
ParallelEdgeRouter | Routes all the multi-edges. |
| routeEdgesParallel (LayoutEdge, LayoutEdge, number, boolean?, number?, number?) | in
ParallelEdgeRouter | Routes two edges which are incident to the same nodes in parallel, optionally joining the end points. |
| calculateSlopedSourceEdgeLayout (NodeLayout, SubtreeShape, LayoutEdge, number, number) | in
SingleLayerSubtreePlacer | Calculates the routing of the source side of the edge to the given child node. |
| calculateSourceEdgeLayout (NodeLayout, SubtreeShape, LayoutEdge) | in
SingleLayerSubtreePlacer | Calculates the routing of the source side of the edge to the given child node. |
| calculateTargetEdgeLayout (NodeLayout, SubtreeShape, LayoutEdge) | in
SingleLayerSubtreePlacer | Calculates the routing of the target side of the edge to the given child node. |
| addEdgeSegments (LayoutGraph, LayoutEdge) | in
SubtreeShape | Adds all edge segments of the given edge to this SubtreeShape instance. |
| appendTargetPoints (LayoutEdge) | in
SubtreeShape | Appends all target points that have previously been added to this shape to the given LayoutEdge instance. |
| assignChildEdgeSourcePort (LayoutGraph, LayoutNode, LayoutEdge, number) | in
TreeLayoutPortAssigner | Assigns relative coordinates to the source port of the outgoing edge to a child of the given node. |
| assignParentEdgeTargetPort (LayoutGraph, LayoutNode, LayoutEdge) | in
TreeLayoutPortAssigner | Assigns relative coordinates to the target port of the incoming edge from the parent of the given node. |
| getSourcePortCandidate (LayoutEdge) | in
TreeLayoutPortAssigner | Retrieves the source LayoutPortCandidate for the given edge. |
| getTargetPortCandidate (LayoutEdge) | in
TreeLayoutPortAssigner | Retrieves the target LayoutPortCandidate for the given edge. |
| routeNonTreeEdges (LayoutGraph, IMapper<LayoutEdge,boolean>) | in
TreeReductionStage | Routes all edges that do not belong to the chosen spanning tree. |