Function petgraph::algo::is_cyclic_directed

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

Return true if the input directed graph contains a cycle.

Using the topological sort algorithm.