Git utilisé dans le cadre du BE Graphe de 3MIC 2022
.idea | ||
be-graphes-algos | ||
be-graphes-gui | ||
be-graphes-model | ||
answers.md | ||
be-graphes-all.iml | ||
DeLorean.java | ||
pom.xml | ||
README.md | ||
UML1.png | ||
UML2.png | ||
Untitled Diagram(1).drawio | ||
Untitled Diagram.drawio |
Graph & Algorithm project — INSA Toulouse
[ LEJEUNE Aurelia & R.LACROIX ]
Part 2
-
Path class implementation
- createFastestPathFromNodes
- createShortestPathFromNodes
- isValid
- getLength
- getTravelTime
- getMinimumTravelTime
Part 3
-
BinaryHeap implementation
- implemented the remove() method
- improved the method by using a hashmap
-
Created Label
- Attributes
- currNode
- marked
- cost
- father
- Methods
- getCost
- compareTo
- Attributes
-
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
- (new) Attributes
-
Modified Dijkstra (modularity)
-
implemented A-Star
- built upon Dijkstra with another Label type
-
More and More testing (see the video).