Function petgraph::algo::scc [−] [src]

pub fn scc<G>(g: G) -> Vec<Vec<G::NodeId>> where G: IntoNeighborsDirected + Visitable + IntoNodeIdentifiers

[Generic] Compute the strongly connected components using Kosaraju's algorithm.

Return a vector where each element is an scc.

For an undirected graph, the sccs are simply the connected components.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)