I need a correction on question 1 MatlockA Quantitative Reasoning 2 Exam 1a page

Question

I need a correction on question 1

MatlockA Quantitative Reasoning 2 Exam 1a page 1 Remember to justify and check all your answers. Also, please remember to enjoy the math. 6 1. Select either the nearest neighbor alcorithm or the sorted edges algorithm and axplainhow to se cast neighbor Start at Opoint A you choo se thosvedys iod the iainmth ost 2. 3 &5 4 Ts ment to Soluc the SP homiltona Ciuit. Us the algorithm that you selected in #1 to find a Hamiltonian circuit of the above graph 2. /6 Total 3. Find the minimum cost spanning tree of the above graph 8- 3, 2, 6,2 -12 2, 3 241 DCA -

Explanation / Answer

Below is the application of nearest neighbour algorithm to the travelling salesman problem .

These are the steps of the algorithm:

you started at A

next node can be B,C,D and E

minimum cost = min (2,4,6,4) = 2

which is B

from B there is path to unvisited node (C,D and E ) that is   min(3,7,6) = 3

hence C .

similarly from C to D and D to E

you just did not write the explantion for selecting the minimum weight

Please rate

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.