Function petgraph::algo::is_cyclic_directed

pub fn is_cyclic_directed<N, E, Ix>(g: &Graph<N, E, Directed, Ix>) -> bool where Ix: IndexType

Check if a directed graph contains cycles.

Using the topological sort algorithm.

Return true if the graph had a cycle.