Subway travel route planning --31,705,466 leaves force

Subway travel planning project


Beijing subway map

Questions asked

Topic purpose

  • A complete issue can be achieved Beijing subway shortest path

The use of environmental topics

  • Windows10 64-bits system that uses language java, using jdk 1.8, using software developed jet beans idel
  • Use GitHub code storage, version management

Job submission

  • The job situation report by the blog regularly park
  • The final code is present on GitHub and submit jobs to save uploaded file
  • Test cases together to txt file is saved in the GitHub

demand analysis

  • Need to complete the program entered a subway station two recent return journey
  • The basic format of the output text input confirmation
  • After several tests to maintain stability program produces results

Design ideas

The experiment ready to adopt the Floyd algorithm has learned

Subway map input format

line Site name Station No. You can change the number of lines
Line 1 Liu Yuan 1 1
Line 1 West Railway Station 2 0
Line 2 Zhang Temple 3 3

Query input format

Site 1: Lingering Garden Site 2: West Railway Station

Output Format

No. Into station Number of stations
1 Liu Yuan 5
2 West Railway Station 2
3 Zhangxingzhuang 6

The total transfer times: three times the total elapsed number of sites: 13 points

Program Details

Program Name time
Needs analysis (including learning new technologies) 2h
Generate design documents 3h
Design review (and colleagues reviewed the design documents) 3h
Code specifications (development of appropriate norms for the current development) 1h
Specific design 3h
Specific coding 3h
test 1h
to sum up 1h
Release code 0.5h

Guess you like

Origin www.cnblogs.com/Clover-yee/p/11569490.html