Preliminary analysis of the subway route planning
Support Environment
windows7, 10, macOS, linux
demand analysis
1. Read the subway information files in a certain format
2. Provide a detailed subway information inquiry
3. To provide the shortest path calculation and recommendation function: the shortest route, the shortest time, at least change the number of subway ...
4.UI show
Design and Implementation
Table 1. The basic circuit design (design concept as follows):
Save only the adjacent site at the same site at the beginning of
Optimal route between the two by two sites last generation
Initial information table:
| Starting site | Destination site | After the subway |
| cancer Hospital | Tianjin Hotel | Line 5, Line 6 |
| Dawangzhuang | Shiyijing road | Line 9 |
| Castle University | Wangdingdi | Line 3 |
| Dabizhuang | South Shunzhuang | Line 6 |
The final information table
| Starting site | Destination site | route |
| Name right door | Jianchang Road | Name right door (line 6) -> Bridge Street Queensway (Line 5) -> channel Jianchang |
| Ocean International Center | Sunco bridge | Line 2 |
| Wangdingdi | A central hospital | Wangdingdi (Line 3) -> red South (line 6) -> a central hospital |
2. algorithm:
Floyd algorithm is first treated with a simple journey information, display information from simple, let the user select the desired starting point and a destination point, or several, pick out the best travel route with the Dijkstra's algorithm and network flow, and finally display recommendation from the complete information. Finally, most of the UI to do a little close to the people.