The problem of finding a path in a graph that visits every vertex exactly once is called?
Posted: Wed Jul 13, 2022 7:41 pm
a) Hamiltonian path problem
b) Hamiltonian cycle problem
c) Subset sum problem
d) Turnpike reconstruction problem
b) Hamiltonian cycle problem
c) Subset sum problem
d) Turnpike reconstruction problem