Post by: HudsonKB16 on Feb 2, 2020
Question 1
Use the complete weighted graph shown to answer the question.
Jon is a traveling salesman for a pharmaceutical company. His territory includes 5 cities and he needs to find the least expensive route to the cities and home. Starting at city A, which of the following is the optimal route using the Nearest Neighbor Method?
I. A, E, C, B, D, A
II. A, E, B, D, C, A
III. A, E, D, B, C, A
IV. A, E, D, C, B, A
◦ I
◦ III
◦ II
◦ IV
Question 2
Determine whether the graph is a tree.
◦ No
◦ Yes
Post by: sylvia on Feb 2, 2020
Answer 1
IIIAnswer 2
No