has_hamiltonian_path

scirs2_graph::algorithms::paths

Function has_hamiltonian_path 

Source 
pub fn has_hamiltonian_path<N, E, Ix>(graph: &Graph<N, E, Ix>) -> bool
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Checks if a graph has a Hamiltonian path (visiting every vertex exactly once)

§Arguments

  • graph - The graph to check

§Returns

  • bool - True if a Hamiltonian path exists