Expected program
Planning |
plan |
1h |
Estimate |
Estimate how much time this task requires |
2h |
Development |
Develop |
5h |
Analysis |
· Needs analysis (including learning new technologies) |
2-3h |
Design Spec |
Generate design documents |
1h |
Design Review |
Design review (and colleagues reviewed the design documents) |
1h |
Coding Standard |
Code specifications (development of appropriate norms for the current development) |
1h |
Design |
Specific design |
1h |
Coding |
Specific coding |
2h |
Code Review |
Code Review |
1h |
Test |
Test (self-test, modify the code, submit modifications) |
2-3h |
Reporting |
report |
1h |
Test Report |
testing report |
1h |
Size Measurement |
Computing workload |
1h |
Postmortem & Process Improvement Plan |
Later summarized, and process improvement plan |
1h |
|
total |
23-25h |
demand analysis
- Calculate the shortest path to the subway line
- Support display subway lines and calculate transfer program
- The query specifies subway line through the site
- Minimum number of stations to reach the destination from the starting point
Realization of ideas
- In order to facilitate the importation and storage of data taken json format, with CJsonObejct as json support library
//地图格式
{
{
"subway-line-name" : "一号线",
"stations" : ["苹果园","古城"]
},
{
"subway-line-name" : "二号线",
"stations" : ["积水潭","鼓楼大街"]
}
}
- abnormal situation
- Line does not exist
- Site not found
- The subway lines abstract undirected graph, the problem is transformed into the undirected graph for the most short-circuit problem
- Dijstra stack using optimization algorithms, may be expected to be a sparse graphs, time complexity \ (O (VlogV) \) , the space complexity \ (O (M + V) \)