| getLayers (Graph, IDataProvider, INodeMap) | in
BfsAlgorithm | Returns the layers of nodes constructed by a breadth first search. |
| getLayers (Graph, YNodeList, INodeMap) | in
BfsAlgorithm | Returns the layers of nodes constructed by a breadth first search. |
| getLayers (Graph, YNodeList, boolean, INodeMap, number?) | in
BfsAlgorithm | Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted. |
| getLayers (Graph, YNodeList, BfsDirection, INodeMap, number?) | in
BfsAlgorithm | Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted. |
| getBipartition (Graph, INodeMap) | in
BipartitionAlgorithm | Calculates a bipartition of the given graph, if one exists. |
| closenessCentrality (Graph, INodeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes the closeness centrality for the nodes of a graph. |
| degreeCentrality (Graph, INodeMap, boolean, boolean) | in
CentralityAlgorithm | Computes the degree centrality for the nodes of a given graph. |
| eigenvectorCentrality (Graph, INodeMap, number?) | in
CentralityAlgorithm | Computes an eigenvector centrality for each node of a given undirected graph. |
| graphCentrality (Graph, INodeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes the graph centrality for the nodes of a graph. |
| nodeBetweenness (Graph, INodeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes betweenness centrality for each node of a given graph. |
| nodeEdgeBetweenness (Graph, INodeMap, IEdgeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes betweenness centrality for each node and edge of a given graph. |
| normalizeNodeMap (Graph, INodeMap) | in
CentralityAlgorithm | Normalizes the double values of a given INodeMap by dividing each of them by the maximum of all values (maximum norm). |
| pageRank (Graph, INodeMap, IDataProvider?, IDataProvider?, IDataProvider?, IDataProvider?, number?, number?) | in
CentralityAlgorithm | Computes page rank values for all nodes based on their attached edges. |
| weightCentrality (Graph, INodeMap, boolean, boolean, IDataProvider) | in
CentralityAlgorithm | Computes the weight centrality for the nodes of a graph. |
| disposeNodeMap (INodeMap) | in
Graph | Informs the graph that the given node map is no longer needed. |
| biconnectedComponents (Graph, IEdgeMap, INodeMap?) | in
GraphConnectivity | Calculates the biconnected components and the articulation points of a given undirected graph and returns the number of biconnected components. |
| connectedComponents (Graph, INodeMap) | in
GraphConnectivity | Calculates the connected components of a given graph and returns their number. |
| kCore (Graph, INodeMap) | in
GraphConnectivity | Calculates the k-cores of an undirected input graph. |
| stronglyConnectedComponents (Graph, INodeMap) | in
GraphConnectivity | Calculates the strongly connected components of a given graph and returns their number. |
| toNodeListArray (Graph, INodeMap, number) | in
GraphConnectivity | Transforms the return values of method connectedComponents to an array of YNodeLists, like it is returned by connectedComponents. |
| biconnectedComponentGrouping (Graph, INodeMap) | in
GroupAlgorithm | This method partitions the graph by analyzing its biconnected components. |
| edgeBetweennessClustering (Graph, INodeMap, boolean, number, number, IDataProvider) | in
GroupAlgorithm | Partitions the graph into groups using edge betweenness centrality. |
| edgeBetweennessClustering (Graph, INodeMap, number, number, number, boolean) | in
GroupAlgorithm | Partitions the graph into groups using edge betweenness clustering proposed by Girvan and Newman. |
| getClusteringCoefficient (Graph, INodeMap, boolean) | in
GroupAlgorithm | Calculates the local clustering coefficient for each node and returns the average clustering coefficient. |
| hierarchicalClustering (Graph, INodeMap, INodeDistanceProvider, Linkage, number) | in
GroupAlgorithm | Partitions the graph into clusters based on hierarchical clustering, while the dendrogram is cut based on a given cut-off value. |
| hierarchicalClustering (Graph, number, INodeMap, INodeDistanceProvider, Linkage) | in
GroupAlgorithm | Partitions the graph into clusters based on hierarchical clustering, while the dendrogram is cut based on a given maximum number of clusters. |
| kMeansClustering (Graph, INodeMap, IDataProvider, DistanceMetric, number, number?, YPoint?) | in
GroupAlgorithm | Partitions the graph into clusters using k-means clustering algorithm. |
| labelPropagation (Graph, INodeMap, IDataProvider?, IDataProvider?, IDataProvider?, IDataProvider?) | in
GroupAlgorithm | Detects the communities in the specified input graph by applying a label propagation algorithm. |
| louvainModularity (Graph, INodeMap, IDataProvider?) | in
GroupAlgorithm | Detects the communities in the specified input graph by applying the louvain modularity method. |
| calcMaxFlowMinCut (Graph, YNode, YNode, IDataProvider, IEdgeMap, INodeMap) | in
NetworkFlowAlgorithm | Solves a maximum flow problem using the preflow-push method but additionally marks all nodes that belong to the minimum cut set that is associated with the source of the network. |
| minCostFlow (Graph, IDataProvider, IDataProvider, IDataProvider, IDataProvider, IEdgeMap, INodeMap) | in
NetworkFlowAlgorithm | Solves a minimum cost flow problem with a capacity scaling algorithm. |
| minCostFlow (Graph, IDataProvider, IDataProvider, IDataProvider, IEdgeMap, INodeMap) | in
NetworkFlowAlgorithm | Uses method minCostFlow to solve a minimum cost flow problem. |
| minCostFlow (Graph, YNode, YNode, IDataProvider, IDataProvider, IEdgeMap, INodeMap) | in
NetworkFlowAlgorithm | Solves a minimum cost maximum flow problem. |
| aggregate (Graph, INodeMap) | in
NodeAggregationAlgorithm | Starts the node aggregation for the specified graph. |
| toNodeMap (Graph, number, INodeMap) | in
NodeOrderAlgorithm | Copies an array-based result returned by a method of this class to a INodeMap that will provide values of basic type int. |
| toNodeMap (YNodeList, INodeMap) | in
NodeOrderAlgorithm | Copies a YNodeList-based result returned by a method of this class to a INodeMap that will provide values of basic type int. |
| findLongestPaths (Graph, YNode, IEdgeMap, INodeMap, IEdgeMap) | in
PathAlgorithm | Calculates the longest path from a given node to all other node in a given directed acyclic graph. |
| simple (Graph, INodeMap, IEdgeMap, number?) | in
RankAssignmentAlgorithm | This method quickly calculates a tight tree given a maximum time duration for the algorithm. |
| simplex (Graph, INodeMap, IDataProvider, IDataProvider, number?) | in
RankAssignmentAlgorithm | Solves the rank assignment problem using the simplex method given a maximum time duration for the algorithm. |
| simplex (Graph, INodeMap, IDataProvider, IDataProvider, IEdgeMap, YNode, boolean, number?) | in
RankAssignmentAlgorithm | Similar to simplex but, additionally, it is possible to provide a valid initial tree solution for the problem. |
| acyclic (Graph, YNode, IDataProvider, INodeMap, INodeMap) | in
ShortestPathAlgorithm | Solves the single-source shortest path problem for acyclic directed graphs. |
| aStar (Graph, YNode, YNode, boolean, IDataProvider, IDataProvider, INodeMap) | in
ShortestPathAlgorithm | Solves the single-source single-sink shortest path problem for arbitrary graphs using an implementation of the well-known a-star algorithm (A*). |
| bellmanFord (Graph, YNode, boolean, IDataProvider, INodeMap, INodeMap) | in
ShortestPathAlgorithm | Solves the single-source shortest path problem for arbitrary graphs. |
| dijkstra (Graph, YNode, boolean, IDataProvider, INodeMap, INodeMap) | in
ShortestPathAlgorithm | Solves the single-source shortest path problem for arbitrary graphs. |
| singleSource (Graph, YNode, boolean, IDataProvider, INodeMap, INodeMap) | in
ShortestPathAlgorithm | This method solves the single-source shortest path problem for arbitrary graphs. |
| singleSourceSingleSink (Graph, YNode, YNode, boolean, IDataProvider, INodeMap) | in
ShortestPathAlgorithm | Like singleSourceSingleSink but uses INodeMaps and IDataProviders instead of arrays. |
| uniform (Graph, YNode, boolean, INodeMap, INodeMap) | in
ShortestPathAlgorithm | Like uniform but uses INodeMaps instead of arrays. |
| getSubTreeDepths (Graph, INodeMap) | in
TreeAlgorithm | Returns the depths of each subtree of a rooted directed tree. |
| getSubTreeSizes (Graph, INodeMap) | in
TreeAlgorithm | Returns the size (number of nodes) of each subtree of a rooted directed tree. |
| getWeightedCenterNode (Graph, INodeMap?) | in
TreeAlgorithm | Finds a node used by the greatest number of all (undirected) paths interconnecting all nodes with each other. |
| triangulatePoints (YList, Graph, INodeMap, IEdgeMap) | in
TriangulationAlgorithm | Computes a triangulation of the given points. |
| assignNodesToSublayer (YNodeList, ILayoutDataProvider, LayoutGraph, INodeMap) | in
SimplexNodePlacer | Assigns the nodes of a given layer to the corresponding upper/lower sublayer if node compaction is enabled. |
| assignLayersFast (Graph, INodeMap) | in
WeightedLayerer | Assigns all nodes of the graph to layers. |
| assignLayersToMap (Graph, INodeMap) | in
WeightedLayerer | Assigns all nodes of the graph to layers. |
| assignNodeLayerWithDataProvider (LayoutGraph, INodeMap, EdgeList, IDataProvider) | in
WeightedLayerer | Assigns all nodes of the graph to layers. |
| findGraphComponents (LayoutGraph, INodeMap) | in
ComponentLayout | Determines which nodes belong to the same graph component. |
| disposeInfoMap (Graph, INodeMap) | in
LayoutGroupingSupport | Disposes of the INodeMap created to store hierarchy information for each node. |
| findPartitions (LayoutGraph, INodeMap) | in
IPartitionFinder | Returns a partition ID for each node of an input graph. |
| findIsolatedGraphComponents (LayoutGraph, INodeMap) | in
IsolatedGroupComponentLayout | Determines the nodes that belong to the same graph component. |
| createNodeMapper (INodeMap) | in
YGraphAdapter | Creates an IMapper<K,V> that delegates to the provided INodeMap when queried for items in the IGraph. |