5. Transportation Seen" 6. finda route ae & Transportation For the diversity if Exetel 20f Section G1 tind a rome yen en in EF and Furs tothe staring city whee HCH city twiee, W city without visiting any For the train routes given in Bxere 7 t0 10, use trial tomian circuits of ttre vertex A in the weighted grant of each circuit 7 I and error to find two Nt total weights, starting at Compute the total weight secrion 62 Ne ooh EEE the greedy algorithm to find se s In Exercises 11 to 4.007 vertex A in the weighted a Hamiltonian circuit starting @ raph, 1. * In Exercises 15 to 18, use the edge-picking algorithm to find a Hamiltonian circuit in the indicated graph. 15. Graph in Exercise 11 16. Graph in Exercise 12 17. Graph in Exercise 13 18. Graph in Exercise 14section 6.2 | weotted Grophs IEEE AI C2 reave 1% es ovslngberecsn te sin Clay bat ge inthe table helo Represem the teleosts between etes using # weighted BFaph Use the greedy algorithin to find a low-cost route that starts and ends in Boulder r ach cy Colorado Springs | Burana | [83s S74 “2 i]t S72 $59 a $32 26, Travel Use the edge-picking algorithm to find a low-cost bus route in Exercise 24. Route Planning Brian nceds to visit the pet store, the shopping mall, the local farmers market, and the pharmacy. His estimated driving times (in minutes) en inte lable bot Use te greedy algorithm and ng at home, between the locations are the edge-picking algorithm to find two possible routes. starting and endi tat will help Brian minimize his total travel time. EERE Ee ESS ee ‘Shopping | Farmers Home | Petstore | mall | market _| Pharmacy | ome = 18 27 5 8 Pet store 8 = 24 22 w | Shopping matt 2 24 = 20 32 | Farmers market | 15 2 20 = 2 Pharmacy 8 10 2 2 = 28, Route Planning A bike messenger needs to deliver packages to five different | buildings and return to the courier company. The estimated biking times (in | | minutes) between the buildings are given in the following table. Use the greedy algorithm and the edge-picking algorithm to find two possible routes for the mes- senger to follow that will help minimize the total travel time Courier] Prudential | Bank of America rial company building | Bank building | GE Tower Courier company = 0 5 5 2 "7 Prudential building 10 — 0 6 9 8 Bank of America building | 0 = 7 18 20 { Imperial Bank building 15 6 7 = 2 16 GE Tower 2 9 18 2 = 5 f Design Center 7 8 20 16 Ss = i