Question

Brute Force Search A Write all possible circuits for the graph in the form <V,, V2V»,V4,V1> Example: <A,B,C,D,A> 1. There will be 24 possible circuits to list 24 18 27 2 For each circuit, calculate the total distance traveled The to tal distance is the sum of each distance on the route 17 Identify the Optimal Circuit 3. 15 The optimal path is the one with the shortest distance 23 Reflection 4. What about the Brute Force Search process of finding the optimal circuit using the above technique requires so many steps? What would the process be like for finding the optimal path for larger graphs (10, 20, 100 nodes) Describe the method you could wou ld use to find a good solution instead of a Brute Force Search? A heuristic is a technique for finding an appraximate solution based on discovery when finding a optimal one is too difficut 5.

please answer all of the question

Answer 1

Distanee Ditanea Kwitorhy くD,C,B, D> 人B.ACP kBrerAeS KBDAIB) LATAIDB ACIDIAB B,C, D, B くB,A.C,D,B> 55 F4 44 ZD, AB, D LrCAID DrC, B,AID D, BA, CiD くD,A, C/ B,ッ 83 55 75 80 Similasty similoly Distam ee AIB.C A) 60 Le,AIBC 55 人CDB少 くA.B,D, A> 59 AerOA KAIDICIBA ZAICIDIBA K2/AID,C 人ei D, B, A,c> Kc.BrA, D, ke,A,D, 6,e 70 LATBTEDAY LAD.B,C,A

Optrinal cireuit s BCDB.0r its combinakion becouse the irouil is closed ui4th having shorteskdlistonea ie 5S Brute Foree Syetom o nding aptrinal dirauitnoads mere bossible cireuits (elosad) r athe Steps have tind all because Veotieos b stots ter optinal safution ri tioet chack the shofost distanees comaating adjoeut Cti) o eheck tthe shootest distance comok adgs euired TYeduce no tha Vosticos than done tte vesticas are i) +the vootiens and tind minimum no. to make a losed eirauit-.