Method find_hamiltonian_cycle

Attempts to find a Hamiltonian cycle in the graph, starting from the specified vertex. A Hamiltonian cycle visits every vertex exactly once and returns to the starting vertex. # Note This implementation may not find all possible Hamiltonian cycles. It stops as soon as it finds one valid cycle. If multiple Hamiltonian cycles exist, only one will be returned. # Returns `Ok(Some(path))` if a Hami

(
        &self,
        start_vertex: usize,
    )