A delivery truck must deliver packages to 6 different store ...

[genevieve1028]

A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at C. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.

The cheapest-link tour starting with vertex C is given by:
◦ C, B, D, F, E, A, C.
◦ C, A, E, F, B, D, C.
◦ C, A, B, D, F, E, C.
◦ C, D, E, F, A, B, C.
◦ none of these

[dominiqueenicolee]

C, A, E, F, B, D, C.

[WWatsford]

A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at C. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.

The cheapest-link tour starting with vertex C is given by:
◦ C, A, B, D, F, E, C.
◦ C, A, E, F, B, D, C.
◦ C, B, D, F, E, A, C.
◦ C, D, E, F, A, B, C.
◦ none of these

[welcom1000]

C, A, E, F, B, D, C.

[Alainaaa8]

A delivery truck must deliver packages to five different store locations (A, B, C, D, and E). The trip must start and end at D. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.

Using both the cheapest-link and the repetitive nearest-neighbor algorithm, the length of the shortest trip we can find (without using brute force) is:
◦ 58 miles.
◦ 50 miles.
◦ 63 miles.
◦ 52 miles.
◦ none of these

[cupcake16]

52 miles.

[khang]

A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.

Using both the cheapest-link and the repetitive nearest-neighbor algorithm, the length of the shortest trip we can find (without using brute force) is:
◦ 27 miles.
◦ 58 miles.
◦ 35 miles.
◦ 44 miles.
◦ none of these

[micaelaswann]

35 miles.

[Marty]

A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.

Using only the nearest-neighbor, repetitive nearest-neighbor, and cheapest-link algorithms (not brute force) on this graph,
◦ the nearest-neighbor and the repetitive nearest-neighbor algorithms both yield the shortest trip.
◦ the repetitive nearest-neighbor algorithm yields the shortest trip.
◦ the cheapest-link and the repetitive nearest-neighbor algorithms both yield the shortest trip.
◦ the cheapest-link algorithm yields the shortest trip.
◦ the nearest-neighbor algorithm yields the shortest trip.

[HandsomeMarc]

the cheapest-link and the repetitive nearest-neighbor algorithms both yield the shortest trip.