Q1071
The problem of finding a path in a graph that visits every vertex exactly once is called?
A.
Hamiltonian path problem
AnswerB.
Hamiltonian cycle problem
C.
Subset sum problem
D.
Turnpike reconstruction problem
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board