Function petgraph::algo::is_cyclic_undirected
source · [−]pub fn is_cyclic_undirected<G>(g: G) -> boolwhere
G: NodeIndexable + IntoEdgeReferences,Expand description
[Generic] Return true if the input graph contains a cycle.
Always treats the input graph as if undirected.