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

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

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

💬 Discuss

✅ Correct 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.

Explanation by: Mr. Dubey

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.

💬 Discussion

📊 Question Analytics

👁️

759

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate