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