| addTransitiveEdges (LayoutGraph, boolean, function(LayoutNode):boolean) | in
LayoutGraphAlgorithms | Creates transitive edges that connect the visible nodes in the specified graph. |
| allPairsShortestPath (LayoutGraph, boolean, IMapper<LayoutEdge,number>) | in
LayoutGraphAlgorithms | Computes the shortest paths between all pairs of nodes in a graph with arbitrary edge costs. |
| allPathEdges (LayoutGraph, LayoutNode, LayoutNode) | in
LayoutGraphAlgorithms | Computes all edges that belong to any directed path from a source node to a sink node. |
| 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. |
| applyTransitiveClosure (LayoutGraph) | in
LayoutGraphAlgorithms | Computes the transitive closure and adds necessary transitive edges to a directed acyclic graph. |
| applyTransitiveReduction (LayoutGraph) | in
LayoutGraphAlgorithms | Computes the transitive reduction for a directed acyclic graph. |
| bfs (LayoutGraph, IEnumerable<LayoutNode>, IMapper<LayoutNode,number>?, TraversalDirection?, number?) | in
LayoutGraphAlgorithms | Executes a breadth-first search (BFS) on a directed or undirected graph, returning the nodes organized into layers. |
| biconnectedComponentClustering (LayoutGraph, IMapper<LayoutNode,number>) | in
LayoutGraphAlgorithms | Partitions the graph into clusters based on its biconnected components. |
| 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. |
| bipartition (LayoutGraph, ICollection<LayoutNode>, ICollection<LayoutNode>) | in
LayoutGraphAlgorithms | Calculates a bipartition of the specified graph, if one exists. |
| 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. |
| cliqueSubstructures (LayoutGraph, number, IMapper<LayoutNode,any>?) | in
LayoutGraphAlgorithms | Identifies and returns a collection of Substructure instances representing the (undirected) cliques within the specified graph, where each clique contains at least minimumSize nodes. |
| closenessCentrality (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the closeness centrality for each node in the specified graph. |
| clusteringCoefficient (LayoutGraph, IMapper<LayoutNode,number>, boolean) | in
LayoutGraphAlgorithms | Computes the local clustering coefficient for each node in the specified graph and returns the average clustering coefficient across all nodes. |
| connectedComponents (LayoutGraph, IMapper<LayoutNode,number>?) | in
LayoutGraphAlgorithms | Calculates the connected components of 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. |
| degreeCentrality (LayoutGraph, boolean?, boolean?) | in
LayoutGraphAlgorithms | Computes the degree centrality for the nodes in the specified graph. |
| delaunayTriangulation (LayoutGraph, IMapper<LayoutNode,Point>, IMapper<LayoutEdge,LayoutEdge>) | in
LayoutGraphAlgorithms | Computes a Delaunay triangulation of the given points. |
| density (LayoutGraph, boolean?) | in
LayoutGraphAlgorithms | Computes the density of the specified graph, considering only a simple version of it (see isSimple). |
| 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. |
| dfsCompletionNodeOrder (LayoutGraph) | in
LayoutGraphAlgorithms | Calculates an ordering of the nodes that corresponds to the order of node completion events in a depth-first search. |
| 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. |
| edgeBetweennessClustering (LayoutGraph, IMapper<LayoutNode,number>, number, number, number, boolean) | in
LayoutGraphAlgorithms | Partitions the graph into clusters using the edge betweenness clustering algorithm proposed by Girvan and Newman. |
| eigenvectorCentrality (LayoutGraph, number?) | in
LayoutGraphAlgorithms | Computes the eigenvector centrality for each node in the specified undirected graph. |
| findAllCycleEdges (LayoutGraph, boolean) | in
LayoutGraphAlgorithms | Returns an IEnumerable<Edge> that contains all the edges that are part of at least one directed or undirected simple cycle in the given graph. |
| findCenterRoot (LayoutGraph) | in
LayoutGraphAlgorithms | Returns the center node of the specified undirected tree. |
| findCycle (LayoutGraph, boolean) | in
LayoutGraphAlgorithms | Returns an IEnumerable<Edge> that contains the edges of a cycle found in the given graph. |
| 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. |
| findIntersections (LayoutGraph, IntersectionItemTypes, IEnumerable<any>?) | in
LayoutGraphAlgorithms | Finds intersections between graph items or a subset of graph items in the specified graph. |
| findLeafNodes (LayoutGraph, boolean?) | in
LayoutGraphAlgorithms | Returns all leaf nodes of the specified tree. |
| findMultiEdges (LayoutGraph, boolean, LayoutNode?) | in
LayoutGraphAlgorithms | Finds and returns the multi-edges in the specified graph or incident to a specific node. |
| findReachableNodes (LayoutGraph, LayoutNode, boolean) | in
LayoutGraphAlgorithms | Determines the set of nodes that are reachable from a specified starting node, considering edges that cannot be traversed. |
| findRoot (LayoutGraph) | in
LayoutGraphAlgorithms | Returns a possible root node for the specified (undirected) tree. |
| findTreeEdges (LayoutGraph, IEnumerable<IEnumerable<LayoutNode>>?) | in
LayoutGraphAlgorithms | Retrieves an array of IEnumerable<T> collections, where each collection contains the edges belonging to a maximal directed subtree of the specified graph. |
| findTreeNodes (LayoutGraph, boolean?) | in
LayoutGraphAlgorithms | Calculates the nodes that belong to a maximal subtree of the specified graph, based on the directed parameter. |
| findWeightedCenterNode (LayoutGraph, IMapper<LayoutNode,number>?) | in
LayoutGraphAlgorithms | Finds the node in the given (undirected) tree that is used by the greatest number of paths interconnecting all nodes. |
| graphCentrality (LayoutGraph, boolean?, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Computes the graph centrality for each node in the specified graph. |
| hierarchicalClustering (LayoutGraph, function(LayoutNode, LayoutNode):number, HierarchicalClusteringLinkage) | in
LayoutGraphAlgorithms | Partitions the specified graph into clusters using hierarchical clustering. |
| hierarchicalClustering (LayoutGraph, IMapper<LayoutNode,number>, function(LayoutNode, LayoutNode):number, HierarchicalClusteringLinkage, number) | in
LayoutGraphAlgorithms | Partitions the specified graph into clusters using hierarchical clustering. |
| hierarchicalClustering (LayoutGraph, number, IMapper<LayoutNode,number>, function(LayoutNode, LayoutNode):number, HierarchicalClusteringLinkage) | in
LayoutGraphAlgorithms | Partitions the specified graph into clusters using hierarchical clustering. |
| independentSets (LayoutGraph) | in
LayoutGraphAlgorithms | Partitions the nodes of the specified graph into independent sets. |
| isAcyclic (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified directed graph is acyclic. |
| isBiconnected (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified undirected graph is biconnected. |
| isBipartite (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified graph is bipartite. |
| isConnected (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified graph is connected. |
| isForest (LayoutGraph, boolean) | in
LayoutGraphAlgorithms | Determines whether the specified graph is a forest, which is defined as a graph whose connected components are either directed rooted trees or undirected trees. |
| isNaryTree (LayoutGraph, number) | in
LayoutGraphAlgorithms | Determines whether the specified graph is a directed rooted tree where each node has at most maximumChildCount children. |
| isPlanar (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified graph is planar. |
| isSimple (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified directed graph is simple. |
| isStronglyConnected (LayoutGraph) | in
LayoutGraphAlgorithms | Determines whether the specified directed graph is strongly connected. |
| isTree (LayoutGraph, boolean?) | in
LayoutGraphAlgorithms | Determines whether the specified graph represents a tree, with an option to check for either a directed rooted tree or an undirected tree. |
| kCore (LayoutGraph, number) | in
LayoutGraphAlgorithms | Calculates the k-core for a given undirected input graph and specific k value. |
| kCores (LayoutGraph, IMapper<LayoutNode,number>) | in
LayoutGraphAlgorithms | Calculates the k-cores of an undirected input graph and assigns the largest k-value to each node. |
| kMeansClustering (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutNode,Point>, KMeansDistanceMetric, number, number?, Point?) | in
LayoutGraphAlgorithms | Partitions the graph into clusters using the k-means clustering algorithm. |
| 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. |
| layerAssignment (LayoutGraph, ILayerAssigner, IMapper<LayoutNode,number>) | in
LayoutGraphAlgorithms | Calculates an assignment of the graph nodes to layers, using the specified layering 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. |
| longPath (LayoutGraph) | in
LayoutGraphAlgorithms | Computes the edges of a heuristically long, undirected, simple path within the given graph. |
| louvainModularity (LayoutGraph, IMapper<LayoutNode,number>, IMapper<LayoutEdge,number>?) | in
LayoutGraphAlgorithms | Finds communities in the specified input graph using the Louvain modularity method. |
| makeBiconnected (LayoutGraph) | in
LayoutGraphAlgorithms | Makes the given graph biconnected by inserting the minimum number of edges required. |
| makeConnected (LayoutGraph) | in
LayoutGraphAlgorithms | Modifies the specified graph by adding additional edges to make it fully connected. |
| makeTreeDirected (LayoutGraph, LayoutNode?) | in
LayoutGraphAlgorithms | Converts the specified undirected tree into a directed rooted tree with the given node as the root by reversing necessary edges. |
| maximalIndependentSet (LayoutGraph) | in
LayoutGraphAlgorithms | Calculates a maximal independent set for the specified graph. |
| 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. |
| nearestCommonAncestor (LayoutGraph, LayoutNode, boolean, IEnumerable<LayoutNode>) | in
LayoutGraphAlgorithms | Finds the nearest common ancestor of a subset of nodes within a directed rooted tree. |
| neighbors (LayoutGraph, IEnumerable<LayoutNode>, number) | in
LayoutGraphAlgorithms | Determines the direct and indirect neighbors of a given set of nodes in the specified graph. |
| 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. |
| predecessors (LayoutGraph, IEnumerable<LayoutNode>, number) | in
LayoutGraphAlgorithms | Determines the direct and indirect predecessors of a specified list of nodes in the given graph. |
| 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. |
| stronglyConnectedComponents (LayoutGraph, IMapper<LayoutNode,number>?) | in
LayoutGraphAlgorithms | Calculates the strongly connected components of the specified graph and returns the total number of components. |
| subTreeDepths (LayoutGraph) | in
LayoutGraphAlgorithms | Calculates and returns the depths of each subtree within a rooted directed tree. |
| subtreeSizes (LayoutGraph) | in
LayoutGraphAlgorithms | Calculates and returns the size (number of nodes) of each subtree within a rooted directed tree. |
| successors (LayoutGraph, IEnumerable<LayoutNode>, number) | in
LayoutGraphAlgorithms | Determines the direct and indirect successors of a specified list of nodes in the given graph. |
| topologicalNodeOrder (LayoutGraph) | in
LayoutGraphAlgorithms | Returns a topological ordering of the nodes in a directed acyclic graph. |
| 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. |
| aggregate (LayoutGraph, IMapper<LayoutNode,NodeAggregationInfo>) | in
LayoutGraphNodeAggregation | Starts the node aggregation for the specified graph. |
| PlanarEmbedding (LayoutGraph) | in
PlanarEmbedding | Creates a new embedding for the specified planar graph. |
| isPlanar (LayoutGraph) | in
PlanarEmbedding | Return whether or not the given graph is planar. |
| applyLayout (LayoutGraph) | in
CircularLayout | Calculates a circular layout for the given graph. |
| applyLayoutCore (LayoutGraph) | in
CircularLayout | Arranges the given graph in a circular fashion. |
| createLayoutData (LayoutGraph) | in
CircularLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the CircularLayout. |
| applyLayout (LayoutGraph) | in
CompactDiskLayout | Calculates a radial arrangement for the given graph. |
| applyLayoutCore (LayoutGraph) | in
CompactDiskLayout | Calculates a radial arrangement for the given graph. |
| createLayoutData (LayoutGraph) | in
CompactDiskLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the CompactDiskLayout. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
AspectRatioComponentLayerAssigner | Assigns all nodes of the graph to layers and registers them to the layers in the given layoutContext based on the given aspect ratio. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
BfsLayerAssigner | Assigns all nodes of the graph to layers and adds them to the layers instance in the given layoutContext. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
ConstraintIncrementalLayerAssigner | Assigns all nodes of the graph to layers and adds them to the layers instance based on relative and absolute layering constraints defined by the given layering constraints. |
| assignLayerCoordinates (LayoutGraph, HierarchicalLayoutContext) | in
CoordinateAssigner | |
| assignSequenceCoordinates (LayoutGraph, HierarchicalLayoutContext, IDrawingDistanceCalculator) | in
CoordinateAssigner | |
| getMinimumDistance (LayoutGraph, HierarchicalLayoutLayer, LayoutNode, LayoutNode) | in
CoordinateAssigner | Specifies the minimum allowed distance between two nodes of the same given layer. |
| getMinimumLayerHeight (LayoutGraph, HierarchicalLayoutContext, HierarchicalLayoutLayer) | in
CoordinateAssigner | Returns the minimum height of a given layer. |
| isFixedNode (LayoutGraph, HierarchicalLayoutContext, LayoutNode, boolean) | in
CoordinateAssigner | Returns whether or not the given node should be treated as a node with fixed (given) coordinates, that is hint USE_EXACT_LAYER_COORDINATES, USE_EXACT_COORDINATES or USE_EXACT_SEQUENCE_COORDINATES. |
| sequenceNodeLayers (LayoutGraph, HierarchicalLayoutContext) | in
DefaultSequencer | |
| dispose (LayoutGraph, HierarchicalLayoutContext) | in
DrawingDistanceCalculator | |
| getMinimumDistance (LayoutGraph, HierarchicalLayoutLayer, HierarchicalLayoutContext, LayoutNode, LayoutNode) | in
DrawingDistanceCalculator | Determines the minimum distance between two LayoutNodes of the same layer. |
| initialize (LayoutGraph, HierarchicalLayoutContext) | in
DrawingDistanceCalculator | |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
FromSketchLayerAssigner | Assigns all nodes of the graph to layers by analyzing already existing node coordinates and adds them to the layers instance in the given layoutContext. |
| getMaximum (LayoutGraph, LayoutNode) | in
FromSketchLayerAssigner | Callback used for calculating the lower (max) value of a given node. |
| getMinimum (LayoutGraph, LayoutNode) | in
FromSketchLayerAssigner | Callback used for calculating the upper (min) value of a given node. |
| sequenceNodeLayers (LayoutGraph, HierarchicalLayoutContext) | in
FromSketchSequencer | Calculates the sequence of the nodes within each layer using the nodes' coordinates. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
GivenLayersAssigner | Assigns all nodes of the graph to layers and adds them to the layers instance in the given layoutContext. |
| sequenceNodeLayers (LayoutGraph, HierarchicalLayoutContext) | in
GivenSequenceSequencer | Calculates the sequence of the nodes within the layers in the given layoutContext based on the specified sequenceComparator. |
| applyLayout (LayoutGraph) | in
HierarchicalLayout | Calculates a hierarchical layout of the given graph. |
| applyLayoutCore (LayoutGraph) | in
HierarchicalLayout | Delegates the calculation of the hierarchical layout to a configured HierarchicalLayoutCore instance. |
| createLayoutData (LayoutGraph) | in
HierarchicalLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the HierarchicalLayout. |
| createItemData (LayoutGraph, HierarchicalLayoutContext) | in
HierarchicalLayoutCore | Callback method that is called during applyLayoutCore that creates the HierarchicalLayoutNodeContext and HierarchicalLayoutEdgeContext instances for nodes and edges and binds them to the items using ItemFactory. |
| dispose (LayoutGraph, HierarchicalLayout) | in
HierarchicalLayoutCore | Disposes of this instance by undoing preparation steps done during prepare. |
| prepare (LayoutGraph, HierarchicalLayout) | in
HierarchicalLayoutCore | Prepares and configures this instance based on the settings of the given HierarchicalLayout. |
| publishLayers (LayoutGraph, HierarchicalLayoutContext) | in
HierarchicalLayoutCore | Callback method that publishes the layering information. |
| publishSequences (LayoutGraph, HierarchicalLayoutContext) | in
HierarchicalLayoutCore | Callback method that publishes the sequencing information. |
| reduceBendCount (LayoutGraph) | in
HierarchicalLayoutCore | Removes the bends which are obviously not necessary. |
| assignPorts (LayoutGraph, HierarchicalLayoutContext) | in
HierarchicalLayoutPortAssigner | Assigns source and target port coordinates to each edge of the graph. |
| getConnectorNode (LayoutGraph) | in
HierarchicalLayoutSubcomponentDescriptor | Determines if there is a unique node outside the subcomponent whose removal would disconnect the component from the remaining graph and returns the node if it exists. |
| assignLayerCoordinates (LayoutGraph, HierarchicalLayoutContext) | in
ICoordinateAssigner | Assigns preliminary y-coordinates for each layer of a hierarchical layout. |
| assignSequenceCoordinates (LayoutGraph, HierarchicalLayoutContext, IDrawingDistanceCalculator) | in
ICoordinateAssigner | Determines the resulting x-coordinates of a hierarchical layout. |
| dispose (LayoutGraph, HierarchicalLayoutContext) | in
IDrawingDistanceCalculator | Disposes of internal data structures. |
| getMinimumDistance (LayoutGraph, HierarchicalLayoutLayer, HierarchicalLayoutContext, LayoutNode, LayoutNode) | in
IDrawingDistanceCalculator | Main interface method called by ICoordinateAssigner instances to determine the minimum distance between LayoutNodes of the same layer. |
| initialize (LayoutGraph, HierarchicalLayoutContext) | in
IDrawingDistanceCalculator | Initializes internal data structures. |
| assignPorts (LayoutGraph, HierarchicalLayoutContext) | in
IHierarchicalLayoutPortAssigner | Assigns to each edge of the graph a source port and target port coordinate pair. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
ILayerAssigner | Assigns all nodes of the graph to layers and adds them to the layers in the given layoutContext. |
| selectAfterLayering (LayoutGraph, HierarchicalLayoutContext) | in
IPortCandidateSelector | Assigns new selected port candidates after the layering information has been determined. |
| selectAfterSequencing (LayoutGraph, HierarchicalLayoutContext) | in
IPortCandidateSelector | Assigns new selected port candidates after the sequence of the nodes has been determined. |
| sequenceNodeLayers (LayoutGraph, HierarchicalLayoutContext) | in
ISequencer | Calculates the sequence of the nodes within each layer of the layers list in the given layoutContext. |
| createEmpty (LayoutGraph) | in
LayoutGraphLayerConstraints | Creates an empty, modifiable constraints instance and registers the constraints with the given graph. |
| createReadonlyView (LayoutGraph) | in
LayoutGraphLayerConstraints | Factory that reads the current state from the given graph's context. |
| createWritableCopy (LayoutGraph) | in
LayoutGraphLayerConstraints | Factory that reads the current state from the given graph's context and copies it to a mutable instance. |
| createEmpty (LayoutGraph) | in
LayoutGraphSequenceConstraints | Creates an empty, modifiable constraints instance and registers the constraints with the given graph. |
| createReadonlyView (LayoutGraph) | in
LayoutGraphSequenceConstraints | Factory that reads the current state from the given graph's context. |
| createWritableCopy (LayoutGraph) | in
LayoutGraphSequenceConstraints | Factory that reads the current state from the given graph's context and copies it to a mutable instance. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
MultiComponentLayerAssigner | |
| merge (LayoutGraph, HierarchicalLayoutContext, HierarchicalLayoutContext) | in
MultiComponentLayerAssigner | Merges the two layer lists contained in the two given HierarchicalLayoutContext instances. |
| insertSameLayerStructures (LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | Inserts a same-layer edge structure for each same-layer edge of the original graph. |
| removeSameLayerStructures (PortCandidateSelectorSameLayerData, LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | Removes the same-layer edge structure created using insertSameLayerStructures. |
| selectAfterLayering (LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | |
| selectAfterSequencing (LayoutGraph, HierarchicalLayoutContext) | in
PortCandidateSelector | |
| 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. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
TopologicalLayerAssigner | Assigns all nodes of the graph to layers and adds them to the layers in the given layoutContext. |
| assignLayers (LayoutGraph, HierarchicalLayoutContext) | in
WeightedLayerAssigner | Assigns all nodes of the graph to layers and adds them to the layers in the given layoutContext. |
| applyLayoutImpl (LayoutGraph) | in
GenericLabeling | Places the labels in the graph after first executing the coreLayout. |
| createLayoutData (LayoutGraph) | in
GenericLabeling | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the GenericLabeling. |
| modifyCandidates (LayoutGraph, IMapper<LayoutNodeLabel,IEnumerable<LabelCandidate>>, IMapper<LayoutEdgeLabel,IEnumerable<LabelCandidate>>) | in
GenericLabeling | Callback method to influence the label candidates available to the labeling algorithm before the algorithm is applied. |
| modifyWeights (LayoutGraph, IMapper<LayoutNodeLabel,IEnumerable<LabelCandidate>>, IMapper<LayoutEdgeLabel,IEnumerable<LabelCandidate>>) | in
GenericLabeling | Callback method to influence the choice of LabelCandidates immediately before the final label positions are chosen. |
| applyLayoutImpl (LayoutGraph) | in
AlignmentStage | Aligns the nodes of the graph into a grid-like structure. |
| createLayoutData (LayoutGraph) | in
AlignmentStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the AlignmentStage. |
| addedPathForEdge (LayoutGraph, LayoutEdge, YList<LayoutNode>) | in
BendSubstitutionStage | Adds information to newly created proxy nodes. |
| applyLayoutImpl (LayoutGraph) | in
BendSubstitutionStage | Replaces all bends in the current scope with temporary proxy nodes before invoking the coreLayout. |
| createLayoutData (LayoutGraph) | in
BendSubstitutionStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to define the edges affected by the BendSubstitutionStage. |
| prepare (LayoutGraph) | in
BendSubstitutionStage | Prepares the graph before calling the coreLayout. |
| restore (LayoutGraph) | in
BendSubstitutionStage | Restores the structure of the graph after the coreLayout has finished. |
| applyLayoutImpl (LayoutGraph) | in
ComponentLayout | Delegates the layout calculation for each component separately to the coreLayout and optionally arranges the components. |
| arrangeComponents (LayoutGraph, SubgraphComponent) | in
ComponentLayout | Produces a component graph layout. |
| calculateComponentBounds (LayoutGraph) | in
ComponentLayout | Calculates the bounds of a graph component including node margins. |
| createLayoutData (LayoutGraph) | in
ComponentLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the ComponentLayout. |
| findGraphComponents (LayoutGraph, IMapper<LayoutNode,number>) | in
ComponentLayout | Determines which nodes belong to the same graph component. |
| routeInterEdges (LayoutGraph, IEnumerable<LayoutEdge>) | in
ComponentLayout | Reroutes the given inter-edges using the current edge routing algorithm. |
| setComponentLocation (LayoutGraph, SubgraphComponent, Point) | in
ComponentLayout | Moves the top-left corner of the subgraph containing the specified nodes and edges to the given location. |
| applyLayoutImpl (LayoutGraph) | in
ContextModificationStage | Temporarily modifies the LayoutGraphContext for the coreLayout run. |
| applyLayoutImpl (LayoutGraph) | in
CurveFittingStage | Changes the edge paths of selected edges of the given graph such that they represent piecewise cubic Bezier curves which approximate the original points of the path. |
| createLayoutData (LayoutGraph) | in
CurveFittingStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to define the edges affected by the CurveFittingStage. |
| applyLayoutImpl (LayoutGraph) | in
GenericLayoutGridStage | Starts the layout. |
| createLayoutData (LayoutGraph) | in
GenericLayoutGridStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the GenericLayoutGridStage. |
| applyLayoutImpl (LayoutGraph) | in
GivenCoordinatesLayout | Changes node locations and edge paths to user-specified values and then invokes the core layout algorithm. |
| createLayoutData (LayoutGraph) | in
GivenCoordinatesLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the GivenCoordinatesLayout. |
| calculateBounds (LayoutGraph, LayoutNode, IListEnumerable<LayoutNode>) | in
GroupBoundsCalculator | Calculates the bounds of the given group node, enlarges the bounds by the padding associated with the group node, and ensures that the size of the group node obeys the associated minimum size. |
| applyLayoutImpl (LayoutGraph) | in
GroupHidingStage | Calculates the layout based on the given core layout algorithm. |
| applyLayout (LayoutGraph) | in
ILayoutAlgorithm | Main layout routine that assigns new layout information to the given graph. |
| calculateBounds (LayoutGraph, LayoutNode, IListEnumerable<LayoutNode>) | in
ILayoutGroupBoundsCalculator | Calculates the bounds of the given group node that contains the given list of child nodes. |
| create (function(LayoutGraph, LayoutNode, IListEnumerable<LayoutNode>):Rect) | in
ILayoutGroupBoundsCalculator | |
| applyLayoutImpl (LayoutGraph) | in
LayoutAnchoringStage | Delegates to the core layout algorithm and moves the graph to where the anchor point coincides with its initial location. |
| createLayoutData (LayoutGraph) | in
LayoutAnchoringStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the LayoutAnchoringStage. |
| LayoutExecutorAsyncWorker (function(LayoutGraph, object):Promise<object>) | in
LayoutExecutorAsyncWorker | Creates a new instance of a layout service worker. |
| initializeWebWorker (function(LayoutGraph, object):Promise<object>) | in
LayoutExecutorAsyncWorker | Initializes a web worker to handle layout requests sent by a LayoutExecutorAsync. |
| createCopy (LayoutGraph, IEnumerable<LayoutNode>?, IEnumerable<LayoutEdge>?, boolean?) | in
LayoutGraph | Creates a new LayoutGraph as a (partial) copy of the specified graph. |
| copyGrouping (LayoutGraph) | in
LayoutGraphGrouping | Replaces the current grouping hierarchy of the specified graph with a new one, based on the current isGrouped and getParent relationships. |
| createReadOnlyView (LayoutGraph) | in
LayoutGraphGrouping | Creates a read-only view of the current grouping hierarchy of the graph. |
| hideGrouping (LayoutGraph) | in
LayoutGraphGrouping | Temporarily hides the current grouping hierarchy of the graph. |
| isFlat (LayoutGraph) | in
LayoutGraphGrouping | Determines whether the given graph is flat. |
| isGrouped (LayoutGraph) | in
LayoutGraphGrouping | Determines whether the given graph is grouped. |
| replaceGrouping (LayoutGraph, function(LayoutNode):boolean?, function(LayoutNode):LayoutNode?) | in
LayoutGraphGrouping | Replaces the existing grouping hierarchy of the graph with a new hierarchy, optionally using the provided isGroupNode and getParent callbacks to define the new hierarchy. |
| LayoutGraphHider (LayoutGraph) | in
LayoutGraphHider | Initializes a new instance of the LayoutGraphHider class for the specified graph. |
| getLayoutGrid (LayoutGraph) | in
LayoutGrid | Returns the LayoutGrid instance of the first node of the given graph having LayoutGridCellDescriptor associated. |
| applyLayout (LayoutGraph) | in
LayoutStageBase | Implementation of the ILayoutAlgorithm interface and main entry point for the layout calculation. |
| applyLayoutImpl (LayoutGraph) | in
LayoutStageBase | Abstract method that performs the actual implementation when the stage is enabled |
| linkCoreLayouts (IEnumerable<ILayoutStage>, function(LayoutGraph):void?) | in
LayoutStageStack | Chains a collection of ILayoutStage instances together and configures them into a stack. |
| applyLayoutImpl (LayoutGraph) | in
LineWrappingStage | Cuts the layout resulting from the coreLayout at a specified width/height and shifts the remaining graph into the next row/column until the layout has the desired width/height. |
| applyLayoutImpl (LayoutGraph) | in
MinimumNodeSizeStage | Resizes all nodes that are smaller than the specified minimum size to that minimum size, executes the coreLayout and restores the original sizes afterwards. |
| applyLayoutImpl (LayoutGraph) | in
OrientationStage | Prepares the graph for orientation change before calling the coreLayout and finishes the orientation change afterwards. |
| completeOrientationChange (LayoutGraph) | in
OrientationStage | Applies the desired orientation to the graph. |
| prepareOrientationChange (LayoutGraph) | in
OrientationStage | Prepares the layout for the desired orientation. |
| applyLayoutImpl (LayoutGraph) | in
PlaceNodesAtBarycenterStage | Starts the layout. |
| createLayoutData (LayoutGraph) | in
PlaceNodesAtBarycenterStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the PlaceNodesAtBarycenterStage. |
| applyLayoutImpl (LayoutGraph) | in
PortPlacementStage | Corrects the ports of the edges considering LayoutPortCandidates, NodePortCandidates, and port groups. |
| createLayoutData (LayoutGraph) | in
PortPlacementStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the PortPlacementStage. |
| applyLayout (LayoutGraph) | in
RadialGroupLayout | Arranges the given grouped graph in the style of a radial group layout. |
| applyLayoutCore (LayoutGraph) | in
RadialGroupLayout | Arranges the given grouped graph in the style of a radial group layout. |
| createLayoutData (LayoutGraph) | in
RadialGroupLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the RadialGroupLayout. |
| applyLayoutImpl (LayoutGraph) | in
RecursiveGroupLayout | Invokes a recursive traversal through the grouping hierarchy of the given graph during which the specified layout algorithms are applied to the content of the groups. |
| createLayoutData (LayoutGraph) | in
RecursiveGroupLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the RecursiveGroupLayout. |
| routeInterEdges (LayoutGraph, IEnumerable<LayoutEdge>) | in
RecursiveGroupLayout | Reroutes the given inter-edges using the current edge routing algorithm. |
| applyLayoutImpl (LayoutGraph) | in
RemoveCollinearBendsStage | Removes collinear bends of the edges in the given graph. |
| applyLayoutImpl (LayoutGraph) | in
RemoveOverlapsStage | Removes node overlaps and displaces nodes of the given graph such that they keep the specified minimum distance to each other. |
| createLayoutData (LayoutGraph) | in
RemoveOverlapsStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the RemoveOverlapsStage. |
| applyLayoutImpl (LayoutGraph) | in
ReverseEdgesStage | Reverses all selected edges before calling the coreLayout and restores the original edge direction after the core layout algorithm has finished. |
| applyLayout (LayoutGraph) | in
SequentialLayout | Executes all layout algorithms in the chain sequentially. |
| applyLayoutImpl (LayoutGraph) | in
SubgraphLayoutStage | Delegates the arrangement of the specified subgraph of the given graph to the coreLayout. |
| createLayoutData (LayoutGraph) | in
SubgraphLayoutStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the SubgraphLayoutStage. |
| applyLayout (LayoutGraph) | in
TabularLayout | Calculates a tabular layout of the graph. |
| applyLayoutCore (LayoutGraph) | in
TabularLayout | Arranges the input graph in a tabular fashion. |
| createLayoutData (LayoutGraph) | in
TabularLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the TabularLayout. |
| applyLayoutImpl (LayoutGraph) | in
TemporaryGroupInsertionStage | Creates temporary group nodes based on the sub-graphs defined by the temporary group descriptors , executes the core layout algorithm, and, finally, removes the temporary group nodes. |
| createLayoutData (LayoutGraph) | in
TemporaryGroupInsertionStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the TemporaryGroupInsertionStage. |
| applyLayoutImpl (LayoutGraph) | in
MultiPageLayout | Calculates a new multi-page layout for the specified graph. |
| createLayoutData (LayoutGraph) | in
MultiPageLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the MultiPageLayout. |
| startLayout (LayoutGraph, TimeSpan) | in
InteractiveOrganicLayout | Starts the layout calculation for the given period of time. |
| applyLayout (LayoutGraph) | in
OrganicLayout | Calculates an organic arrangement of the graph. |
| applyLayoutCore (LayoutGraph) | in
OrganicLayout | Calculates an organic arrangement of the graph. |
| calculateInitialPlacement (LayoutGraph) | in
OrganicLayout | Calculates an initial placement of nodes, before the main organic (force-directed) optimization loop starts. |
| createLayoutData (LayoutGraph) | in
OrganicLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the OrganicLayout. |
| applyLayout (LayoutGraph) | in
OrthogonalLayout | Calculates an orthogonal layout for the given graph. |
| applyLayoutCore (LayoutGraph) | in
OrthogonalLayout | Calculates an orthogonal layout for the given graph. |
| createLayoutData (LayoutGraph) | in
OrthogonalLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the OrthogonalLayout. |
| applyLayout (LayoutGraph) | in
ClearAreaLayout | Clears the specified rectangular area, the area defined via areaNodes or expandedNode by moving all other graph elements currently intersecting with it. |
| applyLayoutCore (LayoutGraph) | in
ClearAreaLayout | Clears the specified rectangular area, the area defined via areaNodes or expandedNode by moving all other graph elements currently intersecting with it. |
| createAreaOutline (LayoutGraph, IEnumerable<LayoutNode>, IEnumerable<LayoutEdge>) | in
ClearAreaLayout | Creates the outline that describes the shape of the given nodes and edges. |
| createLayoutData (LayoutGraph) | in
ClearAreaLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the ClearAreaLayout. |
| applyLayout (LayoutGraph) | in
FillAreaLayout | Tries to fill the specified area in the given graph with elements, such that the resulting layout is more compact. |
| applyLayoutCore (LayoutGraph) | in
FillAreaLayout | Tries to fill the specified area in the given graph with elements, such that the resulting layout is more compact. |
| createLayoutData (LayoutGraph) | in
FillAreaLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the FillAreaLayout. |
| applyLayoutImpl (LayoutGraph) | in
PartialLayout | This method calculates the partial layout. |
| createLayoutData (LayoutGraph) | in
PartialLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the PartialLayout. |
| placeSubgraphs (LayoutGraph, IEnumerable<LayoutNode>) | in
PartialLayout | This method is called during the layout process and places the subgraph components one-by-one onto the drawing area. |
| 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. |
| applyLayout (LayoutGraph) | in
RadialLayout | Calculates a radial arrangement for the given graph. |
| applyLayoutCore (LayoutGraph) | in
RadialLayout | Calculates a radial arrangement for the given graph. |
| createLayoutData (LayoutGraph) | in
RadialLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the RadialLayout. |
| applyLayoutImpl (LayoutGraph) | in
BundledEdgeRouter | Applies the edge bundling algorithm after invoking the coreLayout. |
| applyLayoutImpl (LayoutGraph) | in
CurveRoutingStage | Adds curved segments to the edge routes produced by the coreLayout. |
| createLayoutData (LayoutGraph) | in
CurveRoutingStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to define the edges affected by the CurveRoutingStage. |
| applyLayoutImpl (LayoutGraph) | in
EdgeRouter | Performs the routing of the edges of the input graph. |
| createLayoutData (LayoutGraph) | in
EdgeRouter | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the EdgeRouter. |
| applyLayoutImpl (LayoutGraph) | in
OctilinearRoutingStage | Adds octilinear segments to the edge routes produced by the coreLayout. |
| createLayoutData (LayoutGraph) | in
OctilinearRoutingStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to define the edges affected by the OctilinearRoutingStage. |
| applyLayoutImpl (LayoutGraph) | in
OrganicEdgeRouter | Performs the organic routing of the edges of the input graph. |
| createLayoutData (LayoutGraph) | in
OrganicEdgeRouter | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the OrganicEdgeRouter. |
| applyLayoutImpl (LayoutGraph) | in
ParallelEdgeRouter | Delegates the arrangement of nodes and edges to the coreLayout and routes the multi-edges. |
| findAndHideMultiEdges (LayoutGraph) | in
ParallelEdgeRouter | Hides all multi-edges only leaving one leading edge per group of multi-edges. |
| 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. |
| applyLayoutImpl (LayoutGraph) | in
SelfLoopRouter | Delegates the arrangement of nodes and edges to the coreLayout and routes the self-loops. |
| createLayoutData (LayoutGraph) | in
SelfLoopRouter | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to define the edges affected by the SelfLoopRouter. |
| applyLayoutImpl (LayoutGraph) | in
StraightLineEdgeRouter | Routes the edges as straight lines from their source to their target after invoking the coreLayout. |
| createLayoutData (LayoutGraph) | in
StraightLineEdgeRouter | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the StraightLineEdgeRouter. |
| assignPorts (LayoutGraph, LayoutNode) | in
ISeriesParallelLayoutPortAssigner | Assigns both the incoming edges' target ports as well as all source ports for the outgoing edges. |
| applyLayout (LayoutGraph) | in
SeriesParallelLayout | Calculates a series-parallel layout of the graph. |
| applyLayoutCore (LayoutGraph) | in
SeriesParallelLayout | Calculates a series-parallel layout for the given graph. |
| createLayoutData (LayoutGraph) | in
SeriesParallelLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the SeriesParallelLayout. |
| isSeriesParallelGraph (LayoutGraph) | in
SeriesParallelLayout | Determines whether or not the given graph has a series-parallel structure. |
| assignPorts (LayoutGraph, LayoutNode) | in
SeriesParallelLayoutPortAssigner | Places the ports of edges connecting to the given node according to the port assignment mode. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
AspectRatioSubtreePlacer | Creates an optional ISubtreePlacerProcessor for pre- and post-processing. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
AspectRatioSubtreePlacer | Initializes the local data structures and then arranges the local root relative to the SubtreeShape of its children. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
AssistantSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
AssistantSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
BusSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
BusSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
CompactSubtreePlacer | Creates a ISubtreePlacerProcessor. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
CompactSubtreePlacer | Initializes the local data structures and then arranges the local root relative to the SubtreeShape of its children. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
DendrogramSubtreePlacer | Creates an optional ISubtreePlacerProcessor for pre- and post-processing. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
DendrogramSubtreePlacer | Arranges the SubtreeShapes of the local root and its children as a dendrogram. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
DoubleLayerSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
DoubleLayerSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
FixedSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
FixedSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
ISubtreePlacer | Creates an optional ISubtreePlacerProcessor for pre- and post-processing. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
ISubtreePlacer | Arranges the SubtreeShapes of the local root and its children and routes the edges that connect them. |
| assignPorts (LayoutGraph, LayoutNode) | in
ITreeLayoutPortAssigner | Places the ports of edges connecting to the given node. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
LeftRightSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
LeftRightSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
LevelAlignedSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
LevelAlignedSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
MultiLayerSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
MultiLayerSubtreePlacer | |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
MultiSplitSubtreePlacer | Creates an ISubtreePlacerProcessor that prepares the graph for splitting children into multiple clusters based on port grouping. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
MultiSplitSubtreePlacer | Places the clusters of SubtreeShapes according to their port group ids. |
| applyLayout (LayoutGraph) | in
RadialTreeLayout | Calculates a radial tree layout of the graph. |
| applyLayoutCore (LayoutGraph) | in
RadialTreeLayout | Arranges the given graph as a tree graph in a radial-tree-like fashion. |
| createLayoutData (LayoutGraph) | in
RadialTreeLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the RadialTreeLayout. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
SingleLayerSubtreePlacer | Creates an optional ISubtreePlacerProcessor for pre- and post-processing. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
SingleLayerSubtreePlacer | Initializes the local data structures and then arranges the local root relative to the SubtreeShape of its children. |
| createProcessor (TreeLayout, LayoutGraph, LayoutNode) | in
SingleSplitSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
SingleSplitSubtreePlacer | |
| addEdgeSegments (LayoutGraph, LayoutEdge) | in
SubtreeShape | Adds all edge segments of the given edge to this SubtreeShape instance. |
| applyLayout (LayoutGraph) | in
TreeLayout | Calculates a tree layout of the graph. |
| applyLayoutCore (LayoutGraph) | in
TreeLayout | Arranges the given graph as a tree. |
| createLayoutData (LayoutGraph) | in
TreeLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the TreeLayout. |
| layoutRoot (LayoutGraph, LayoutNode) | in
TreeLayout | Calculates the layout for the given root node and its subtrees. |
| 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. |
| assignPorts (LayoutGraph, LayoutNode) | in
TreeLayoutPortAssigner | Places the ports of edges connecting to the given node according to the port assignment mode. |
| applyLayout (LayoutGraph) | in
TreeMapLayout | Arranges the given input graph as a tree map. |
| createLayoutData (LayoutGraph) | in
TreeMapLayout | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the TreeMapLayout. |
| applyLayoutImpl (LayoutGraph) | in
TreeReductionStage | Determines a spanning tree of the graph and passes it to the coreLayout. |
| createLayoutData (LayoutGraph) | in
TreeReductionStage | Returns an instance of LayoutData<TNode,TEdge,TNodeLabel,TEdgeLabel> that can be used to perform item-specific configurations for the TreeReductionStage. |
| routeNonTreeEdges (LayoutGraph, IMapper<LayoutEdge,boolean>) | in
TreeReductionStage | Routes all edges that do not belong to the chosen spanning tree. |