| getLayers (Graph, IDataProvider) | in
BfsAlgorithm | Returns the layers of nodes constructed by a breadth first search. |
| getLayers (Graph, IDataProvider, INodeMap) | in
BfsAlgorithm | Returns the layers of nodes constructed by a breadth first search. |
| closenessCentrality (Graph, INodeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes the closeness centrality for the nodes of a graph. |
| edgeBetweenness (Graph, IEdgeMap, boolean, IDataProvider) | in
CentralityAlgorithm | Computes betweenness centrality for each edge of a given 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. |
| 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. |
| createComparableDataComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of arbitrary type. |
| createIntDataComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of arbitrary type. |
| createIntDataSourceComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of type Edge. |
| createIntDataTargetComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of type Edge. |
| createNumberDataComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of arbitrary type. |
| createNumberDataSourceComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of type Edge. |
| createNumberDataTargetComparer (IDataProvider) | in
Comparers | Returns a IComparer<T> that compares objects of type Edge. |
| 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. |
| createNegatedDataProvider (IDataProvider) | in
DataProviders | Returns a IDataProvider that returns the negated boolean values provided by another data provider. |
| createSourceDataProvider (IDataProvider) | in
DataProviders | Returns a IDataProvider for edges that return the data provider values bound to their source nodes. |
| createTargetDataProvider (IDataProvider) | in
DataProviders | Returns a IDataProvider for edges that return the data provider values bound to their target nodes. |
| EdgeList (IEdgeCursor, IDataProvider) | in
EdgeList | Creates a list that is initialized with those edges from the given EdgeCursor object for which the given data provider returns true upon calling its getBool method. |
| addDataProvider (Object, IDataProvider) | in
Graph | Registers the given data provider using the given look-up key. |
| getAverageWeightedDegree (Graph, boolean, IDataProvider) | in
GraphChecker | Computes the average weighted degree of a given graph. |
| getDiameter (Graph, boolean, IDataProvider) | in
GraphChecker | Computes the diameter of a given graph. |
| GraphPartitionManager (Graph, IDataProvider) | in
GraphPartitionManager | Instantiates a new GraphPartitionManager for the given graph. |
| initPartitions (IDataProvider) | in
GraphPartitionManager | Initializes internal data structures using the new DataProvider. |
| edgeBetweennessClustering (Graph, INodeMap, boolean, number, number, IDataProvider) | in
GroupAlgorithm | Partitions the graph into groups using edge betweenness centrality. |
| getModularity (Graph, IDataProvider, IDataProvider?) | in
GroupAlgorithm | Computes the modularity of a given graph. |
| 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. |
| createHighPerformanceDoubleMap (IDataProvider, IDataAcceptor, number) | in
Maps | Creates a resettable high performance map for values of type double. |
| createHighPerformanceIntMap (IDataProvider, IDataAcceptor, number) | in
Maps | Creates a resettable high performance map for values of type int. |
| createHighPerformanceMap (IDataProvider, IDataAcceptor, Object) | in
Maps | Creates a resettable high performance map for values of type Object. |
| 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. |
| NodeList (INodeCursor, IDataProvider) | in
YNodeList | Creates a list that is initialized with those nodes from the given NodeCursor object for which the given data provider returns true upon calling its getBool method. |
| findLongestPath (Graph, IDataProvider?) | in
PathAlgorithm | Returns the longest directed path in a given acyclic weighted graph. |
| 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) | 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*). |
| 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. |
| constructEdgePath (YNode, YNode, IDataProvider) | in
ShortestPathAlgorithm | Like constructEdgePath but the path edges are given by a IDataProvider. |
| constructNodePath (YNode, YNode, IDataProvider) | in
ShortestPathAlgorithm | Like constructNodePath but the path edges are given by a IDataProvider. |
| dijkstra (Graph, YNode, boolean, IDataProvider, INodeMap, INodeMap) | in
ShortestPathAlgorithm | Solves the single-source shortest path problem for arbitrary graphs. |
| findShortestUniformPaths (Graph, YNode, IDataProvider, boolean, number, EdgeList, YNodeList) | in
ShortestPathAlgorithm | Finds all nodes and edges that belong to a shortest path from a start node to a set of target nodes in the graph not farther away than a given distance. |
| kShortestPaths (Graph, IDataProvider, YNode, YNode, number) | in
ShortestPathAlgorithm | This method finds the k shortest paths connecting a pair of nodes in a directed graph with non-negative edge costs. |
| kShortestPathsCursor (Graph, IDataProvider, YNode, YNode, number) | in
ShortestPathAlgorithm | A variant of kShortestPaths that returns the result as a special cursor that calculates the next path in the sequence only when needed. |
| shortestPair (Graph, YNode, YNode, boolean, IDataProvider) | in
ShortestPathAlgorithm | Returns two edge-disjoint paths in a non-negatively weighted directed graph, such that both paths connect nodes s and t and have minimum total length. |
| 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) | in
ShortestPathAlgorithm | Similar to singleSourceSingleSink but instead of returning the shortest distance between the source and sink the actual shortest edge path between these nodes will be returned. |
| singleSourceSingleSink (Graph, YNode, YNode, boolean, IDataProvider, INodeMap) | in
ShortestPathAlgorithm | Like singleSourceSingleSink but uses INodeMaps and IDataProviders instead of arrays. |
| sortNodesByIntKey (Graph, IDataProvider) | in
SortingAlgorithm | Sorts the nodes of a given graph by an integer key associated with each node through a IDataProvider. |
| cost (EdgeList, IDataProvider) | in
SpanningTreeAlgorithm | Returns the overall cost of a previously calculated minimum spanning tree. |
| kruskal (Graph, IDataProvider) | in
SpanningTreeAlgorithm | Calculates a minimum spanning tree for the given graph. |
| minimum (Graph, IDataProvider) | in
SpanningTreeAlgorithm | Calculates a minimum spanning tree for the given graph. |
| prim (Graph, IDataProvider) | in
SpanningTreeAlgorithm | Calculates a minimum spanning tree for the given graph. |
| getChains (Graph, number, IDataProvider?, IDataProvider?) | in
Substructures | Returns a list of Substructures that represent the chains in the specified graph with at least minimumSize nodes. |
| getCliques (Graph, number, IDataProvider?) | in
Substructures | Returns a list of Substructures that represent the (undirected) cliques in the specified graph with at least minimumSize nodes. |
| getCycles (Graph, number, IDataProvider?, IDataProvider?) | in
Substructures | Returns a list of Substructures that represent the cycles in the specified graph with at least minimumSize nodes. |
| getStars (Graph, number, IDataProvider?, IDataProvider?) | in
Substructures | Returns a list of Substructures that represent the stars in the specified graph with at least minimumSize nodes. |
| getTrees (Graph, number, IDataProvider?, IDataProvider?) | in
Substructures | Returns a list of Substructures that represent the trees in the specified graph with at least minimumSize nodes. |
| transitiveEdges (Graph, IDataProvider, boolean) | in
TransitivityAlgorithm | Creates the transitive edges that connect the visible nodes in the specified graph. |
| 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. |
| YList (ICursor, IDataProvider) | in
YList | Creates a list that is initialized with those elements from the given YCursor object for which the given data provider returns true upon calling its getBool method. |
| normalize (Graph, IDataProvider, IDataAcceptor) | in
GivenLayersLayerer | Convenience method that removes empty layers and ensures that the smallest layer has value 0. |
| sort (YNodeList, IDataProvider) | in
MultiComponentLayerer | Sorts an array which consists of YNodeLists each of which contains nodes that belong to the same component. |
| calculateSelfLoops (LayoutGraph, YNode, IDataProvider, IDataProvider) | in
SelfLoopCalculator | Calculates all self-loops at the given node of the given input graph. |
| calculateSelfLoops (LayoutGraph, YNode, YList, IDataProvider, IDataProvider) | in
SelfLoopCalculator | Convenience method that calculates a list of self-loops that belong to a given node. |
| assignNodeLayerWithDataProvider (LayoutGraph, INodeMap, EdgeList, IDataProvider) | in
WeightedLayerer | Assigns all nodes of the graph to layers. |
| routeInterEdges (LayoutGraph, IDataProvider, IDataProvider) | in
IPartitionInterEdgeRouter | Routes inter-edges of the partitioned graph. |
| placePartitions (LayoutGraph, IDataProvider, IDataProvider) | in
IPartitionPlacer | Arranges the graph while taking partition IDs and inter-edge information into account. |
| determineEdgeFlowDirection (LayoutGraph, IDataProvider) | in
LayoutGraphUtilities | Determines the main direction of the edge flow by analyzing the current layout of the graph. |
| isUsingOctilinearEdgeRoutes (LayoutGraph, IDataProvider) | in
LayoutGraphUtilities | Determines whether or not most of the edges of the graph are routed octilinear. |
| isUsingOrthogonalEdgeRoutes (LayoutGraph, IDataProvider) | in
LayoutGraphUtilities | Determines whether or not most of the edges of the graph are routed orthogonally. |
| arrangeSwimlanes (Graph, IDataProvider) | in
Swimlanes | Calculates an ordering of the swimlanes. |
| arrangeSwimlanes (Graph, IDataProvider, number, SwimlanesMode) | in
Swimlanes | Calculates an ordering of the swimlanes considering the specified ordering mode. |
| createMapper (IDataProvider) | in
YGraphAdapter | Creates an IMapper<K,V> that delegates to the provided IDataProvider when queried for items in the IGraph. |
| applyIncrementalLayout (LayoutGraph, IDataProvider, LayoutContext) | in
MultiPageLayout | This method is called to further improve the layout results. |
| routeRestoredEdges (LayoutGraph, IDataProvider, YRectangle) | in
MultiPageLayout | This method is called whenever some single edges have to be routed without changing the position of nodes (e.g., by removeConnectorPair to route the restored edges). |
| replaceHubsBySubgraph (LayoutGraph, IDataProvider, IDataAcceptor) | in
BusRepresentations | Changes the representation of buses from hubs to complete subgraphs. |
| replaceHubsBySubgraph (LayoutGraph, EdgeList, IDataProvider, IDataProvider, IDataAcceptor) | in
BusRepresentations | Changes the representation of buses from hubs to complete subgraphs by creating new edges between regular nodes and removing the hubs. |
| replaceSubgraphByHubs (LayoutGraph, IEdgeCursor, IDataProvider, IDataAcceptor) | in
BusRepresentations | Changes the representation of buses from complete subgraphs to hubs by replacing intersection points by hubs. |
| toEdgeLists (Graph, IDataProvider) | in
BusRepresentations | Calculates for every bus represented by hubs a list of all of its edges. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
AssistantNodePlacer | Delegates the arrangement of SubtreeShapes to an instance of LeftRightNodePlacer. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
DelegatingNodePlacer | Places the SubtreeShapes of the child nodes using the two delegate node placers retrieved with primaryPlacer and secondaryPlacer. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
DendrogramNodePlacer | Arranges the SubtreeShapes of the local root and its children as a dendrogram. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
GroupedNodePlacer | Places the groups of SubtreeShapes according to their group IDs. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
ITreeLayoutNodePlacer | Arranges the SubtreeShapes of the local root and its children and routes the edges that connect them. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
LeafNodePlacer | Creates a SubtreeShape for the local root node (a leaf node in this case) and adds target points to the incoming edge. |
| createLeftRightDataProvider (IDataProvider) | in
LeftRightNodePlacer | Creates a special IDataProvider that determines whether a given node is placed left or right of the parent node. |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
NodePlacerBase | Initializes the local data structures and then delegates the work to the abstract variant of this method (placeSubtreeOfNode) |
| placeSubtree (IDataProvider, IDataProvider, LayoutGraph, YNode, ParentConnectorDirection) | in
RotatableNodePlacerBase | Initializes the local data structures and then delegates the work to the abstract variant of this method (placeSubtreeOfNode). |
| applyLayoutUsingDummies (LayoutGraph, IDataProvider) | in
TreeComponentLayout | Delegates the layout calculation to the core layout algorithm and handles the dummy nodes. |