135k views
2 votes
Which of the following is the cheapest route to visit each city using the "Nearest Neighbor Algorithm" starting

from A and ending at A.

ABCDA
ADCBA
ABDCA
None of the Above

Which of the following is the cheapest route to visit each city using the "Nearest-example-1

1 Answer

4 votes

Answer:

none of the above

Explanation:

well

ABCDA is equivalent to $880

ADCBA is also $880

ABDCA is more than $880

none sounds good

User Shafeeq
by
8.3k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories