56 lines
No EOL
1.3 KiB
Markdown
56 lines
No EOL
1.3 KiB
Markdown
# Graph & Algorithm project — INSA Toulouse
|
|
**[ LEJEUNE Aurelia & R.LACROIX ]**
|
|
|
|
## Part 2
|
|
|
|
- ✅ [First UML diagram](answers.md)
|
|
|
|
- ✅ Path class implementation
|
|
- ✅ createFastestPathFromNodes
|
|
- ✅ createShortestPathFromNodes
|
|
- ✅ isValid
|
|
- ✅ getLength
|
|
- ✅ getTravelTime
|
|
- ✅ getMinimumTravelTime
|
|
|
|
## Part 3
|
|
|
|
- ✅ [Second UML diagram](answers.md)
|
|
|
|
- ✅ BinaryHeap implementation
|
|
- ✅ implemented the remove() method
|
|
- ✅ improved the method by using a hashmap
|
|
|
|
- ✅ Created Label
|
|
- ✅ Attributes
|
|
- ✅ currNode
|
|
- ✅ marked
|
|
- ✅ cost
|
|
- ✅ father
|
|
- ✅ Methods
|
|
- ✅ getCost
|
|
- ✅ compareTo
|
|
|
|
- ✅ implemented Dijkstra
|
|
- ✅ handling special types of paths (pedestrians, car roads etc)
|
|
- ✅ added notifyNodeReached to show reached nodes on map
|
|
- ✅ Testings (lots of)
|
|
|
|
## Part 4
|
|
|
|
- ✅ Modified Label
|
|
- ✅ included getTotalCost
|
|
|
|
- ✅ Created LabelStar (inherits from Label)
|
|
- ✅ (new) Attributes
|
|
- ✅ crowCost
|
|
- ✅ Methods
|
|
- ✅ getTotalCost
|
|
|
|
- ✅ Modified Dijkstra (modularity)
|
|
|
|
- ✅ implemented A-Star
|
|
- ✅ built upon Dijkstra with another Label type
|
|
|
|
|
|
- ✅ More and More testing (see the video). |