Description
1. Implement Dijkstra’s to find the shortest distance from
Dallas to the cities on the map below. Identify paths and
the corresponding distance.
2. Determine the MST (identify edges and total mileage)
Work with a different partner from your project 2 team.
Due April 22nd
Seattle
San Francisco
Los Angeles
807
381
Chicago
Boston
New
York
Atlanta
Houston Miami
Dallas
Kansas City
Denver
2097
1015
1003
983
214
888
661
1187 239
496
533
1331
1267
1435
1663
599
787
1260
864
781
810