Function petgraph::algo::is_cyclic_directed

pub fn is_cyclic_directed<G>(g: G) -> boolwhere
    G: IntoNodeIdentifiers + IntoNeighbors + Visitable,

[Generic] Return true if the input directed graph contains a cycle.

This implementation is recursive; use toposort if an alternative is needed.