2. For the following graph find the all pair shortest path. Determine the shortest path and distance both from all the active cities. City 'chottogram' and 'dhaka' is flooded and you can not visit via...

Q1.

Extracted text: 2. For the following graph find the all pair shortest path. Determine the shortest path and distance both from all the active cities. City 'chottogram' and 'dhaka' is flooded and you can not visit via those two cities. Other cities are active cities where you can go and visit. You must visit the cities alphabetically. 2 obugram boguna Chottogram ヌ 10 8. -イ dhaka 3 Yemal goy Faridpur