| getAverageWeightedDegree (IMapper<IEdge,number>, boolean?) | in
GraphStructureAnalyzer | Computes the average weighted degree of the graph. |
| getDiameter (IMapper<IEdge,number>, boolean?) | in
GraphStructureAnalyzer | Computes the diameter of the 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. |
| 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. |
| 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. |
| delaunayTriangulation (LayoutGraph, IMapper<LayoutNode,Point>, IMapper<LayoutEdge,LayoutEdge>) | in
LayoutGraphAlgorithms | Computes a Delaunay triangulation of the given points. |
| 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. |
| 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. |
| 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, 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. |
| 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. |
| 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. |
| stronglyConnectedComponents (LayoutGraph, IMapper<LayoutNode,number>?) | in
LayoutGraphAlgorithms | Calculates the strongly connected components of the specified graph and returns the total number of components. |
| 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. |
| copyTo (IMapper<TKey,TValue>) | in
ResultItemMapping | Copies the entries of this mapping into the given mapper. |
| from (IMapper<K,V>) | in
IMapper | Creates an IMapper<K,V> instance from the given mapper-like object by performing automatic type conversion. |
| addInputMapper (Constructor<TKey>, Constructor<TData>, string, IMapper<TKey,TData>) | in
GraphMLIOHandler | Register an IMapper<K,V> instance for use as an input data target. |
| addInputMapper (Constructor<TKey>, Constructor<TData>, function(Element):boolean, IMapper<TKey,TData>, function(IParseContext, Node, Constructor):TData) | in
GraphMLIOHandler | Register an IMapper<K,V> instance for use as an input data target. |
| addOutputMapper (Constructor<TModelItem>, Constructor<TValue>, string, IMapper<TModelItem,TValue>) | in
GraphMLIOHandler | Register an IMapper<K,V> instance for use as an output data source |
| addOutputMapper (Constructor<TModelItem>, Constructor<TValue>, string, string, IMapper<TModelItem,TValue>, function(IWriteContext, TValue, Constructor):void, KeyType) | in
GraphMLIOHandler | Register an IMapper<K,V> instance for use as an output data source. |
| createMapperInputHandler (Constructor<TKey>, Constructor<TData>, IMapper<TKey,TData>, function(IParseContext, Node, Constructor):TData) | in
GraphMLIOHandler | Creates an IInputHandler implementation that matches the provided TKey and TData. |
| createMapperOutputHandler (Constructor<TKey>, Constructor<TData>, string, IMapper<TKey,TData>, function(IWriteContext, TData, Constructor):void) | in
GraphMLIOHandler | Creates an IOutputHandler implementation that matches the provided TKey and TData. |
| sort (YList<LayoutNode>, IMapper<LayoutNode,number>) | in
MultiComponentLayerAssigner | Sorts an array which consists of YList<T>s, where each list contains nodes that belong to the same component. |
| 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. |
| findGraphComponents (LayoutGraph, IMapper<LayoutNode,number>) | in
ComponentLayout | Determines which nodes belong to the same graph component. |
| addReplacementMap (NodeDataKey<T>, IMapper<LayoutNode,T>) | in
ContextModificationStage | Adds the specified key to the data keys whose associated data is temporarily replaced 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. |
| addReplacementMap (NodeLabelDataKey<T>, IMapper<LayoutNodeLabel,T>) | in
ContextModificationStage | Adds the specified key to the data keys whose associated data is temporarily replaced by this stage. |
| addReplacementMap (EdgeLabelDataKey<T>, IMapper<LayoutEdgeLabel,T>) | in
ContextModificationStage | Adds the specified key to the data keys whose associated data is temporarily replaced by this stage. |
| disposeEdgeDataMap (IMapper<LayoutEdge,TValue>) | in
LayoutGraph | Informs the graph that the specified IMapper<K,V> is no longer needed. |
| disposeNodeDataMap (IMapper<LayoutNode,TValue>) | in
LayoutGraph | Informs the graph that the specified IMapper<K,V> is no longer needed. |
| addItemData (NodeDataKey<T>, IMapper<INode,T>) | in
LayoutGraphAdapter | Registers data for individual nodes at the graph with the specified NodeDataKey<TValue>. |
| addItemData (EdgeDataKey<T>, IMapper<IEdge,T>) | in
LayoutGraphAdapter | Registers data for individual edges at the graph with the specified EdgeDataKey<TValue>. |
| addItemData (NodeLabelDataKey<T>, IMapper<ILabel,T>) | in
LayoutGraphAdapter | Registers data for individual node labels at the graph with the specified NodeLabelDataKey<TValue>. |
| addItemData (EdgeLabelDataKey<T>, IMapper<ILabel,T>) | in
LayoutGraphAdapter | Registers data for individual edge labels at the graph with the specified EdgeLabelDataKey<TValue>. |
| addItemData (NodeDataKey<TValue>, IMapper<LayoutNode,TValue>) | in
LayoutGraphContext | Registers data for individual nodes at the graph with the specified NodeDataKey<TValue>. |
| addItemData (EdgeDataKey<TValue>, IMapper<LayoutEdge,TValue>) | in
LayoutGraphContext | Registers data for individual edges at the graph with the specified EdgeDataKey<TValue>. |
| addItemData (NodeLabelDataKey<TValue>, IMapper<LayoutNodeLabel,TValue>) | in
LayoutGraphContext | Registers data for individual node labels at the graph with the specified NodeLabelDataKey<TValue>. |
| addItemData (EdgeLabelDataKey<TValue>, IMapper<LayoutEdgeLabel,TValue>) | in
LayoutGraphContext | Registers data for individual edge labels at the graph with the specified EdgeLabelDataKey<TValue>. |
| 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. |
| createCopiedToOriginalNodeWrapper (IMapper<LayoutNode,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 nodes. |
| createOriginalToCopiedEdgeWrapper (IMapper<IEdge,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 structureGraph, but translates requests so they can be made using the corresponding copied edges. |
| createOriginalToCopiedNodeWrapper (IMapper<INode,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 structureGraph, but translates requests so they can be made using the corresponding copied nodes. |
| routeEdges (LayoutGraph, IMapper<LayoutEdge,YList<LayoutEdge>>) | in
ParallelEdgeRouter | Routes all the multi-edges. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
AspectRatioSubtreePlacer | Provides the direction of the connector to the SubtreeShape for each child node. |
| 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. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
AssistantSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
AssistantSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
BusSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
BusSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
CompactSubtreePlacer | Provides the direction of the connector to the SubtreeShape for each child node. |
| 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. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
DendrogramSubtreePlacer | Provides UP for all children. |
| 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. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
DoubleLayerSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
DoubleLayerSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
FixedSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
FixedSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
ISubtreePlacer | Provides the direction of the connector to the SubtreeShape for each child node. |
| 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. |
| preProcess (IMapper<LayoutNode,ISubtreePlacer>, IMapper<LayoutNode,ITreeLayoutPortAssigner>, IMapper<LayoutNode,function(LayoutEdge,LayoutEdge):number>) | in
ISubtreePlacerProcessor | Performs preparations for the actual tree layout in a pre-processing step. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
LeftRightSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
LeftRightSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
LevelAlignedSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
LevelAlignedSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
MultiLayerSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
MultiLayerSubtreePlacer | |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
MultiSplitSubtreePlacer | Delegates to the ISubtreePlacer responsible for arranging the nodes in one cluster. |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
MultiSplitSubtreePlacer | Places the clusters of SubtreeShapes according to their port group ids. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
SingleLayerSubtreePlacer | Determines the connector direction for each subtree based on the selected transformation applied to the subtree. |
| 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. |
| determineChildConnectors (LayoutNode, IMapper<LayoutNode,ParentConnectorDirection>) | in
SingleSplitSubtreePlacer | |
| placeSubtree (IMapper<LayoutNode,SubtreeShape>, IMapper<LayoutNode,SubtreeShape>, LayoutGraph, LayoutNode, ParentConnectorDirection) | in
SingleSplitSubtreePlacer | |
| TreeLayoutData () | in
TreeLayoutData | |
| routeNonTreeEdges (LayoutGraph, IMapper<LayoutEdge,boolean>) | in
TreeReductionStage | Routes all edges that do not belong to the chosen spanning tree. |
| createGraphAnimation (IGraph, IMapper<INode,IRectangle>?, IMapper<IEdge,yfiles.geometry.IPoint[]>?, IMapper<IPort,IPortLocationModelParameter>?, IMapper<ILabel,ILabelModelParameter>?, TimeSpan?) | in
IAnimation | Creates a new IAnimation that animates the given layout of all types of graph items. |