contestada

Which of the following is one of the cheapest routes to pass through each vertex once starting and ending with Vertex "A" and using the Nearest Neighbor Algorithm.


Group of answer choices

ABCDA, $960

ACDBA, $900

ACBDA, $960

None of the Above

Which of the following is one of the cheapest routes to pass through each vertex once starting and ending with Vertex A and using the Nearest Neighbor Algorithm class=

Respuesta :

ivankerwin

Answer:

The answer is A

Step-by-step explanation:

The cheapest route should be c) ABCDA, $960

calculation of cheapest route:

Starting at A: Options are B = 220, C = 240, D = 310

Now

Choose B since it has the smallest value.

Now

From B: Options are C = 200, D = 210

Choose C since it has the smallest value.

From C: There is only one option i.e. D = 230 here we cannot choose A since it was our beginning point.

From D: We touched all of the vertices due to this,  return to the starting point, A = 310

So,

A → B → C → D → A --> 220 + 200 + 230 + 310 = 960

learn more about the vertex here:https://brainly.com/question/2765283

Otras preguntas