Path Adviser based on Shortest Path Algorithms
Ⅰ. Purpose
- To better understand the graph data structures learned in this course
- Be more familiar with graph algorithms especially the shortest path algorithms
Ⅱ. Requirements
- Implementation
- You can choose one piece of map of any place you like.
- The size of your chosen map must be appropriate: it should contain dozens of paths. (At least 20 nodes and no more than 30 nodes)
- User enter the start and end place, then you print out the recommended path.
- Your application should at least give the shortest walking route.(Bus route is bonus)
- ATTENTION: You should show the used time of each query.
- Document
Document is very important, and you need to:
- Tell how to use your application.
- Show that which algorithm is used and explain why you choose that.
- Analyze your implementation’s performance with collected data.
Ⅲ. Score Points
| Item | Cost | |
| Application
Implement (50%) |
correct program logic | 10% |
| can choose specific location | 10% | |
| can choose any location | 10% | |
| map scale | 10% | |
| single path type | 10% | |
| Coding Style | 10% | |
| Algorithm Efficiency | 20% | |
| Document | 20% | |
| Bonus | UI | 5% |
| composite path type | 5% | |
Ⅳ. Simple Demo
User click the map twice to determine start and end location, and choose walk or bus in the right side. Then the recommended path will be painted on the map and be described in the text area of right side. (ATTENTION: The red bold part is bonus)
