Question

Heuristic Challenge Doing a brute force search (trying every path) is prohibitively difficult for finding a solution for a 7 point graph. Come up with an approach that will alw you to find a good low cost circuit (f not necessarily the best) 6. Select a "good" circuit in the the following graph and give the cost of traversing it The lowest cost circuit in the class gets 15 points B CDE F 012 32 24 9 12 010 Any score in the to 20% of circuit will get 12 paints A G 21 17 Any score in the top 50% of circuit will get 10 points Any vaid circuit will earn 5 points 20 30 2 14 32 10 5 12 10 16 This is weighted adja cency matrix for the graph you are looking to traverse. For simplicity sake the graph is non-directed 0 24 31 14 5 22 4 E 30 12 22 0 12 24 21 210 31 12 F 0 You can use this information to draw a graph is you want to visualize the graph. See question 9 in project 2 for a refresher. G 17 20 16 4 24 70 7O E

Must select a circuit, and give total traversal cost

Answer 1

D 31 24 A 21 17 12 12 30 1イ 10 2 20 LO 16 5 32 12 14 22 3 1 21 36 12 1 2 24 10 31 12 2 1 2 16 20 17 イや 24 Row Reduction A 23 1S XN g A0 O18 12 2 8 - 18 27 0 16 1 D 3 ts 2 3 fF 2 1 29 F 19 2 1 2 O20 13 Redinhm coluomn TD A 22 A- 1& 12 2 & 10 27 18 27 0 D-20 f 1/3 $2 2 1 29 1 1 2 0 24 TO' O

to maintain min cost Asign 10 total ust 15 3 total 15 10 13 total ast 13 Dos total ust 23 Henu the path ia A- A E unt 2-