pub fn is_cyclic<G>(graph: &G) -> boolwhere G: ?Sized + DirectedGraph + WithStartNode + WithSuccessors + WithNumNodes,
Returns true if the graph has a cycle that is reachable from the start node.
true