| edgeBetweenness (Graph, IEdgeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes betweenness centrality for each edge of a given graph. |
| nodeEdgeBetweenness (Graph, INodeMap, IEdgeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes betweenness centrality for each node and edge of a given graph. |
| normalizeEdgeMap (Graph, IEdgeMap) | in
CentralityAlgorithm | Normalizes the double values of a given IEdgeMap by dividing each of them by the maximum of all values (maximum norm). |
| findCycleEdges (Graph, IEdgeMap, IDataProvider?) | in
CycleAlgorithm | Marks the edges of a given graph whose removal or reversal would make the graph acyclic while trying to minimize the cost associated with the marked edges. |
| findCycleEdgesDFS (Graph, IEdgeMap) | in
CycleAlgorithm | Marks the edges of a given graph whose removal or reversal would make the graph acyclic based on a depth first search. |
| disposeEdgeMap (IEdgeMap) | in
Graph | Informs the graph that the given edge 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. |
| toEdgeListArray (Graph, IEdgeMap, number) | in
GraphConnectivity | Transforms the return values of biconnectedComponents to an array of EdgeLists, like it is returned by biconnectedComponents. |
| calcMaxFlow (Graph, YNode, YNode, IDataProvider, IEdgeMap) | in
NetworkFlowAlgorithm | Solves a maximum flow problem using the preflow-push 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. |
| findAllPaths (Graph, YNode, YNode, IEdgeMap) | in
PathAlgorithm | Finds all edges that belong to a directed path from a start node to an end node. |
| 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. |
| findPath (Graph, YNodeList, YNode, YNode, IEdgeMap) | in
PathAlgorithm | Returns whether or not a directed path from a start node to another node in an acyclic graph exists. |
| 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, IEdgeMap, YNode, boolean, number?) | in
RankAssignmentAlgorithm | Similar to simplex but, additionally, it is possible to provide a valid initial tree solution for the problem. |
| findShortestUniformPaths (Graph, YNode, YNode, boolean, IEdgeMap) | in
ShortestPathAlgorithm | Marks all edges that belong to a shortest path from start node to target node. |
| calcDelauneyTriangulation (Graph, IDataProvider, IEdgeMap) | in
TriangulationAlgorithm | Computes a Delauney triangulation of the given points. |
| triangulatePoints (Graph, IDataProvider, IEdgeMap) | in
TriangulationAlgorithm | Computes a triangulation of the given points. |
| triangulatePoints (YList, Graph, INodeMap, IEdgeMap) | in
TriangulationAlgorithm | Computes a triangulation of the given points. |
| createPortConstraintsFromSketch (LayoutGraph, IEdgeMap, IEdgeMap) | in
PortConstraintConfigurator | Creates weak PortConstraints for all edges of the given graph. |
| createPortConstraintsFromSketch (LayoutGraph, IEdgeCursor, IEdgeMap, boolean, IEdgeMap, boolean) | in
PortConstraintConfigurator | Creates PortConstraints for some edges of the given graph. |
| createEdgeMapper (IEdgeMap) | in
YGraphAdapter | Creates an IMapper<K,V> that delegates to the provided IEdgeMap when queried for items in the IGraph. |
| layoutParallelEdges (LayoutGraph, IEdgeMap) | in
ParallelEdgeRouter | Assigns a layout to all parallel edges. |
| routeNonTreeEdges (LayoutGraph, IEdgeMap) | in
TreeReductionStage | Routes all edges that do not belong to the chosen spanning tree. |