Which of the following problems is similar to that of a Hamiltonian path problem?
|B.||closest pair problem|
|C.||travelling salesman problem|
|Answer» C. travelling salesman problem|
|Explanation: hamiltonian path problem is similar to that of a travelling salesman problem since both the problem traverses all the nodes in a graph exactly once.|
Login to Continue
It will take less than 2 minutes