contestada

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 Neighbor Algorithm starting from A and ending at A ABCDA ADCBA ABDCA None of t class=

Respuesta :

7ting

Answer:

none of the above

Step-by-step explanation:

well

ABCDA is equivalent to $880

ADCBA is also $880

ABDCA is more than $880

none sounds good

Otras preguntas