Multiple Choice
A traveling salesman must visit all four cities indicated in the figure below. Which is the shortest route he can take if he wants to begin and end in city A? 
A) ABCDA
B) ACDBA
C) ABDCA
D) ADBCA
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q19: In a complete binary tree, how many
Q20: Which of the following is NOT a
Q21: What is the degree of vertex F?
Q22: If a circuit traverses each edge of
Q23: What size dictionary can be accommodated by
Q25: Suppose you tell a story to two
Q26: One night you put a quarter into
Q27: What is the degree of each vertex
Q28: You want to use a dictionary so
Q29: Every vertex of a tree is either