Q. The problem of finding a path in a graph that visits every vertex exactly once is called? (Solved)
1. hamiltonian path problem
2. hamiltonian cycle problem
3. subset sum problem
4. turnpike reconstruction problem
- a. hamiltonian path problem
1. hamiltonian path problem
2. hamiltonian cycle problem
3. subset sum problem
4. turnpike reconstruction problem