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

Mr. Dubey • 52.26K Points
Coach

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

(D) turnpike reconstruction problem

Correct : Option (A)

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.

Discusssion

Q. Inductive learning is

Q. What is size of master boot record ?

Q. The string with zero characters is called___________.

Q. What is the output of the following program? dictionary1 = {'GFG' : 1, 'Google' : 2, 'GFG' : 3 } print(dictionary1['GFG']);

Q. A canonical set of items is given below S --> L. > R Q --> R. On input symbol < the set has

Q. The UML was designed for describing

Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.

Q. Group of functionally related objects is …

Q. ______________ is a classical approach to database design?

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

Discusssion

Related MCQs