Module 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

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

Check if a directed graph contains cycles.

is_cyclic_undirected

Return true if the input graph contains a cycle.

is_isomorphic

Return true if the graphs g0 and g1 are isomorphic.

min_spanning_tree

Return a Minimum Spanning Tree of a graph.

scc

Compute Strongly connected components using Kosaraju's algorithm.

toposort

Perform a topological sort of a directed graph.