The problem of finding a path in a graph that visits every vertex exactly once is called?

• A. Hamiltonian path problem
• B. Hamiltonian cycle problem
• C. Subset sum problem
• D. Turnpike reconstruction problem