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