Git utilisé dans le cadre du BE Graphe de 3MIC 2022
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Lacroix Raphael d2a9172b7b aded comments 4 months ago
.idea added hashMap to the binaryHeap to bring complexity from n to log(n) 4 months ago
be-graphes-algos aded comments 4 months ago
be-graphes-gui aded comments 4 months ago
be-graphes-model added images and commented code 4 months ago
DeLorean.java added images and commented code 4 months ago
README.md updated readme with spaces 4 months ago
UML1.png added images and commented code 4 months ago
UML2.png added images and commented code 4 months ago
answers.md updated readme 4 months ago
be-graphes-all.iml first dijkstra 5 months ago
pom.xml added partie 2 first part 6 months ago

README.md

Graph & Algorithm project — INSA Toulouse

[ LEJEUNE Aurelia & R.LACROIX ]

Part 2

  • First UML diagram

  • ✅ Path class implementation

    • ✅ createFastestPathFromNodes
    • ✅ createShortestPathFromNodes
    • ✅ isValid
    • ✅ getLength
    • ✅ getTravelTime
    • ✅ getMinimumTravelTime

Part 3

  • Second UML diagram

  • ✅ 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).