1. Computer Science Engineering (CSE)
  2. Data Structures (DS)
  3. ____________ is finding a path/tour thro...

____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

A. Travelling Salesman tour.
B. Eulerian tour.
C. Hamiltonian tour.
D. None.
Answer» C. Hamiltonian tour.
View all MCQs in:   Data Structures (DS)