Method hamiltonian_cycle_util

Recursively searches for a Hamiltonian cycle. This function is called by `find_hamiltonian_cycle`. # Arguments `path` - A mutable vector representing the current path being explored. `visited` - A mutable vector representing the visited vertices. `pos` - The position of the current vertex being considered. # Returns `true` if a Hamiltonian cycle is found, `false` otherwise.

(
        &self,
        path: &mut [Option<usize>],
        visited: &mut [bool],
        pos: usize,
    )