Used to find if a graph has a path that visits every vertex exactly once. If the path starts and ends at the same vertex, it is a Hamiltonian circuit.
Used to find if a graph has a path that visits every vertex exactly once. If the path starts and ends at the same vertex, it is a Hamiltonian circuit.