Q. The problem of finding a path in a graph that visits every vertex exactly once is called?
✅ Correct Answer: (A)
hamiltonian path problem
Explanation: hamiltonian path problem is a problem of finding a path in a graph that visits every node exactly once whereas hamiltonian cycle problem is finding a cycle in a graph.