- Time spent.
PSP 2.1 |
Personal Software Process Stages |
Time (Plan) |
Time (Actual) |
Planning |
Plan |
|
|
· Estimate |
· Estimate how long this task will take |
1min |
1min |
Development |
Development |
|
|
· Analysis |
· Demand analysis (including learning new technologies) |
3h |
3h |
· Design Spec |
· Creating a design Document |
15min |
15min |
· Design Review |
· Design Review (and colleagues review design documents) |
0 |
0 |
· Coding Standard |
· Code specification (to develop appropriate specifications for current development) |
0 |
0 |
· Design |
· Specific design |
30min |
3h |
· Coding |
· Specific code |
4h |
5h |
· Code Review |
· Code review |
2h |
2h |
· Test |
· Test (self-test, modify code, commit changes) |
2h |
2h |
Reporting |
Report |
|
|
· Test Report |
· Test report |
2h |
2h |
· Size Measurement |
· Computational effort |
2h |
2h |
· Postmortem & Process Improvement Plan |
· Summarize afterwards and propose process improvement plan |
1h |
1h |
|
Total |
16h |
20h |
- Program Improvement and performance analysis
To achieve the highest efficiency for each inquiry,-B uses pure DFS, efficiency is O (n), and-C separates the same station of different lines, the edge of the middle connecting length (1, 0), and the edge of the other adjacent stations (0, 1), and then uses the Dijkstra algorithm, the efficiency is O (NLOGN) ;-a strategy to choose a point from the current point, the shortest way to reach the target point, the point of view should obviously not choose between the current point and the target point there are other points, that is, the current point is V, the target point is U, then for any one not selected X (x! = v && x! = u) Have dis[v][x] + dis[x][u] > Dis[v][u], if according to such a point of the solution must be able to calculate the positive solution, but the complexity is too high. Using an approximate optimization is to select the closest to the current point of the non-selected points, if there are more than one of the same distance, select the BFS in turn. This total complexity is still high, so limit the number of searches, the final result is: 12s: 449-length ring, 196s: 445-length ring, 2988s: 443-length ring. The search is then limited to the end of the 445 ring.
The following is the performance analysis result of-C:
- Test
-B know Chun Road Wangfujing
-C-Zhi Chun Road Wangfujing
Terminal 3rd, Terminal C 2nd
-B Chegongzhuang Jishuitan
-C Yu Xin Huilongguan
-B xizhimen Gulou Street
-C Xizhimen Gulou Street
-B Nam Shao Yizhuang railway station
-C South Shao Yizhuang railway station
-A Shahe
- What did the personal project learn?
How to use VS
Software Engineering personal Projects