Module daggy::petgraph::algo [] [src]

Graph algorithms.

It is a goal to gradually migrate the algorithms to be based on graph traits so that they are generally applicable. For now, most of these use only the Graph type.

Functions

condensation

Condense every strongly connected component into a single node and return the result.

connected_components

Return the number of connected components of the graph.

dijkstra

Dijkstra's shortest path algorithm.

is_cyclic

Deprecated: Renamed to is_cyclic_undirected.

is_cyclic_directed

Return true if the input directed graph contains a cycle.

is_cyclic_undirected

Return true if the input graph contains a cycle.

is_isomorphic

Return true if the graphs g0 and g1 are isomorphic.

is_isomorphic_matching

Return true if the graphs g0 and g1 are isomorphic.

min_spanning_tree

Compute a minimum spanning tree of a graph.

scc

Compute the strongly connected components using Kosaraju's algorithm.

toposort

Perform a topological sort of a directed graph.