A task
1. To achieve a subway travel route planning help with command-line program. The figure is the Beijing subway map
Second, demand analysis
1. Design line storage formats and can display the sites and subway routes and stops
2. Query the specified site and line
3. Query the shortest path two sites and give information transfer.
Third, the design ideas
1. FIG subway line information and the like stored in the form of a text file up, the application can read the file.
2. The two sites are the shortest path calculation algorithm Dijkstras.
3. Site and output line information on the shortest path.
4. design interface.
Fourth, implement plan
| Personal Software Process Stages | Time（hour） |
| · Needs analysis (including learning new technologies) | 3 |
| Generate design documents | 2 |
| · Code specifications (development of appropriate norms for the current development) | 3 |
| · Specific design | 2 |
| · Specific coding | 5 |
| · Code Review | 2 |
| · Test (self-test, modify the code, submit modifications) | 2 |
V. Summary
The core of this task is the shortest path to the two sites, to consider the transfer and optimize the shortest path algorithm.
For storage of data to choose the right way. While the interface is simple to operate.