The nearest-neighbor algorithm constructs a(n) _______________ circuit in a complete graph by starting at a vertex.
A)Fleury
B)Euler
C)Vector
D)Hamilton

Question

Quizplus · Accepted Answer

The nearest-neighbor algorithm constructs a Hamiltonian circuit in a complete graph by starting at a vertex and connecting to the closest unvisited vertex until all vertices have been visited. Therefore, the best choice is D, Hamilton, as it is the only option that represents a circuit in a complete graph that visits each vertex exactly once.

The Nearest-Neighbor Algorithm Constructs A(n) _______________ Circuit in a Complete