| findAllCycleEdges (Graph, boolean) | in
CycleAlgorithm | Returns an EdgeList that contains all the edges that are part of at least one directed or undirected simple cycle. |
| findCycle (Graph, boolean) | in
CycleAlgorithm | Returns an EdgeList that contains the edges of a cycle found in the given graph. |
| biconnectedComponents (Graph) | in
GraphConnectivity | Calculates the biconnected components of a given undirected graph. |
| makeBiconnected (Graph) | in
GraphConnectivity | Makes the given graph biconnected by inserting a minimum number of edges in the graph. |
| makeConnected (Graph) | in
GraphConnectivity | Makes a graph connected by adding additional edges to the graph. |
| toEdgeListArray (Graph, IEdgeMap, number) | in
GraphConnectivity | Transforms the return values of biconnectedComponents to an array of EdgeLists, like it is returned by biconnectedComponents. |
| findParallelEdges (Graph, boolean, YNode?) | in
ParallelEdgesAlgorithm | Finds and returns the parallel edges in the given graph, or, optionally, incident to the given node. |
| findAllChains (Graph, boolean) | in
PathAlgorithm | Returns all chains present in the given graph. |
| findAllPaths (Graph, YNode, YNode, boolean) | in
PathAlgorithm | Returns all simple directed or undirected paths that connect a start node with an end node. |
| findAllPaths (Graph, YNode, YNode, boolean, function(EdgeList):boolean) | in
PathAlgorithm | A variant of findAllPaths which returns all simple directed or undirected paths between two given nodes and, additionally, allows to specify a filter for the paths to be returned. |
| findLongestPath (Graph, IDataProvider?) | in
PathAlgorithm | Returns the longest directed path in a given acyclic weighted graph. |
| findLongPath (Graph) | in
PathAlgorithm | Returns an EdgeList containing the edges of an undirected simple path within the given graph. |
| findPath (Graph, YNode, YNode, boolean) | in
PathAlgorithm | Returns an EdgeList containing the edges of a path from the given start node to the given end node, if such a path exists. |
| aStar (Graph, YNode, YNode, boolean, number, number) | 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) | 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*). |
| constructEdgePath (YNode, YNode, Edge) | in
ShortestPathAlgorithm | Convenience method that constructs an explicit path of edges from the result returned by one of the shortest paths methods defined in this class. |
| constructEdgePath (YNode, YNode, IDataProvider) | in
ShortestPathAlgorithm | Like constructEdgePath but the path edges are given by a IDataProvider. |
| 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. |
| singleSourceSingleSink (Graph, YNode, YNode, boolean, number) | 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) | 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. |
| 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. |
| uniform (Graph) | in
SpanningTreeAlgorithm | Calculates a spanning tree for the given graph in which each edge has a uniform cost of 1.0. |
| transitiveEdges (Graph, IDataProvider, boolean) | in
TransitivityAlgorithm | Creates the transitive edges that connect the visible nodes in the specified graph. |
| directTree (Graph, YNode?) | in
TreeAlgorithm | Converts the given tree to a directed rooted tree with the given node as root element by reversing some edges. |
| getTreeEdges (Graph, YNodeList?) | in
TreeAlgorithm | Returns an array of EdgeList objects each containing edges that belong to a maximal directed subtree of the given graph. |
| insertEdge (Edge) | in
IItemFactory | Inserts a same-layer Edge or an Edge that may span multiple layers into the data structure and returns the resulting list of Edges that has been created if this edge spans multiple layers. |
| getEdgesGoingIn (YNode) | in
LayoutGroupingSupport | Returns all edges crossing the bounds of the given group node such that their targets are inside the group node while their sources lie outside the group node. |
| getEdgesGoingOut (YNode) | in
LayoutGroupingSupport | Returns all edges crossing the bounds of the given group node such that their sources are inside the group node while their targets lie outside the group node. |
| createEdgeList (IEnumerable<IEdge>) | in
YGraphAdapter | Creates an EdgeList that maps the edges from the IEnumerable<T> to their copied ones. |
| 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. |
| toEdgeLists (Graph, IDataProvider) | in
BusRepresentations | Calculates for every bus represented by hubs a list of all of its edges. |
| directTree () | in
TreeLayout | Returns a list of edges that need to be reversed in order to obtain a valid rooted and directed tree from the input graph. |