Function petgraph::algo::is_cyclic_directed
[−]
[src]
pub fn is_cyclic_directed<G>(g: G) -> bool where G: IntoNodeIdentifiers + IntoNeighborsDirected + IntoExternals + Visitable
[Generic] Return true
if the input directed graph contains a cycle.
Using the topological sort algorithm.