# Graph & Algorithm project — INSA Toulouse
 **[ LEJEUNE Aurelia & R.LACROIX ]**

## Part 2

- [X] [First UML diagram](answers.md) 

- [X] Path class implementation
    - [X] createFastestPathFromNodes
    - [X] createShortestPathFromNodes
    - [X] isValid
    - [X] getLength
    - [X] getTravelTime
    - [X] getMinimumTravelTime

## Part 3

- [X] [Second UML diagram](answers.md)

- [X] BinaryHeap implementation
    - [X] implemented the remove() method
    - [X] improved the method by using a hashmap
    
- [X] Created Label
    - [X] Attributes
        - [X] currNode
        - [X] marked      
        - [X] cost
        - [X] father
    - [X] Methods
        - [X] getCost
        - [X] compareTo

- [X] implemented Dijkstra
    - [X] handling special types of paths (pedestrians, car roads etc)
    - [X] added notifyNodeReached to show reached nodes on map
    - [X] Testings (lots of)

## Part 4

- [X] Modified Label
  - [X] included getTotalCost

- [X] Created LabelStar (inherits from Label)
    - [X] (new) Attributes
        - [X] crowCost
    - [X] Methods
        - [X] getTotalCost

- [X] Modified Dijkstra (modularity)    

- [X] implemented A-Star
    - [X] built upon Dijkstra with another Label type
    

- [X] More and More testing (see the video).