A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). 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.
The shortest trip in this situation can be found using
A. the repetitive nearest-neighbor algorithm.
B. the cheapest-link algorithm.
C. both the nearest-neighbor and the cheapest-link algorithms.
D. the nearest-neighbor algorithm.
E. all of these algorithms give the shortest trip in this situation.
Answer: A
Mathematics
You might also like to view...
Find the eccentricity of the ellipse.x2 + 36y2 = 36
A. 
B. 
C. 
D. 
Mathematics
Find the indicated derivative.Find y " if y = -3 cos x.
A. y " = 3 sin x B. y " = -3 sin x C. y " = -3 cos x D. y " = 3 cos x
Mathematics
Evaluate the expression 
for each choice of a, b, and c.a = 1, b = 0, c = 49
A. 7 B. 7i C. 49i D. i
Mathematics
Find an equation of variation for the given situation.y varies inversely as x, and y = 6 when x = 14
A. y = 
B. y = 
C. y = 
D. y = 84x
Mathematics