Function petgraph::algo::is_cyclic_undirected
[−]
[src]
pub fn is_cyclic_undirected<N, E, Ty, Ix>(g: &Graph<N, E, Ty, Ix>) -> bool where
Ty: EdgeType,
Ix: IndexType,
Return true
if the input graph contains a cycle.
Always treats the input graph as if undirected.