It is a goal to gradually migrate the algorithms to be based on graph traits
so that they are generally applicable. For now, some of these still require
Compute dominators of a control-flow graph.
An algorithm error: a cycle was found in the graph.
Workspace for a graph traversal.
An iterator producing a minimum spanning forest of a graph.
An algorithm error: a cycle of negative weights was found in the graph.
A floating-point measure.
Associated data that can be used for measures (such as length).
Returns iterator that produces all simple paths from
[Generic] A* shortest path algorithm.
[Generic] Compute shortest paths from node
Graph Condense every strongly connected component into a single node and return the result.
[Generic] Return the number of connected components of the graph.
[Generic] Dijkstra's shortest path algorithm.
[Generic] Check if there exists a path starting at
[Generic] Compute the strongly connected components using Kosaraju's algorithm.
[Generic] Compute a minimum spanning tree of a graph.
[Generic] Compute the strongly connected components using Tarjan's algorithm.
[Generic] Perform a topological sort of a directed graph.