Function is_hamiltonian_cycle 

pub fn is_hamiltonian_cycle(graph: &Graph, cycle: &[u32]) -> IgraphResult<bool>

Check whether a sequence of vertices forms a valid Hamiltonian cycle.

A valid Hamiltonian cycle visits every vertex exactly once and the last vertex is adjacent to the first.

Examples

use rust_igraph::{Graph, is_hamiltonian_cycle};

let g = Graph::from_edges(
    &[(0,1),(1,2),(2,3),(3,0)], false, Some(4)
).unwrap();
assert!(is_hamiltonian_cycle(&g, &[0, 1, 2, 3]).unwrap());