Question 1160836
<br>
Correct.<br>
With the nearest neighbor algorithm, you always take the shortest/cheapest path to another vertex from the vertex you are at.  With the graph shown, that is answer C.<br>
As any good resource will tell you, the nearest neighbor algorithm will often not yield the optimal circuit, especially if it leads you to having to travel long/expensive paths near the end of the circuit.<br>
That is exactly what happens here; the nearest neighbor algorithm has the last leg of the circuit along edge DA, which is the longest/most expensive edge in the graph.<br>