McqMate
| Q. |
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 |
| 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. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet