Function has_cycle 

pub fn has_cycle<N, E>(g: &DiGraph<N, E>) -> bool
where
    N: Clone,

Check if a graph contains any cycles.

Uses petgraph’s is_cyclic_directed algorithm.