Multiple Choice
A traveling salesman must visit all four cities indicated in the figure below. When he starts in A, what is the second city to visit according to the nearest-neighbor algorithm? 
A) B
B) C
C) D
D) C or D
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q10: If each parent of a tree has
Q11: According to Euler's theorem, a connected graph
Q12: The following table shows the distance (in
Q13: According to Euler's theorem, the figure below
Q14: In a complete binary tree of height
Q16: Which of the following is NOT a
Q17: Estimate the largest number of checks needed
Q18: The edges in a certain graph represent
Q19: In a complete binary tree, how many
Q20: Which of the following is NOT a