On a map there are roads from town A of length 10, 26, 12, and 50 miles. Using the nearest-neighbor algorithm for finding a Hamiltonian circuit starting at town A, which road would be traveled first?
A) Road of length 10
B) Road of length 26
C) Road of length 12
D) Road of length 50

Question

Quizplus · Accepted Answer

The nearest-neighbor algorithm involves starting at a particular point and traveling to the closest neighboring point. In this case, town A has four neighboring towns connected by roads of different lengths. The road of length 10 is the shortest and therefore closest to town A. Therefore, it would be the first road traveled in the Hamiltonian circuit using the nearest-neighbor algorithm.

On a Map There Are Roads from Town a of Length