复旦大学：《数据结构与算法设计》综合项目_Project3. All-pairs shortest path

Project 3 All-pairs shortest path Given a small map(a part of shanghai map Input: starting point and termination(two locations in the map) Output: the shortest path from start point to termination and the corresponding routing in detail. At least, you should provide the information about the distance and the possible time cost. Also, you lassify your solutions into different ke by of buses or suby The take into account, the more grades you will get Document is very important, and you need to explain what you have done, how you implement it and why. Meanwhile, you should inform us that the different work each of your team members have done in this project Gradi (1) Algorithm and implemented code(including three use cases)(60%) (2) Efficiency of the algorithm(20%)

1 Project 3 All-pairs shortest path Given a small map (a part of shanghai map). Input: starting point and termination (two locations in the map). Output: the shortest path from start point to termination and the corresponding routing in detail. At least, you should provide the information about the distance and the possible time cost. Also, you may classify your solutions into different cases, like by means of buses or subways. The more you take into account, the more grades you will get. Document is very important, and you need to explain what you have done, how you implement it and why. Meanwhile, you should inform us that the different work each of your team members have done in this project. Enjoy it and gook luck! Grading (1) Algorithm and implemented code (including three use cases) (60%). (2) Efficiency of the algorithm (20%). (3) Document (20%)