|
@@ -5,6 +5,7 @@
|
5
|
5
|
|
6
|
6
|
- ✅ [First UML diagram](answers.md)
|
7
|
7
|
|
|
8
|
+
|
8
|
9
|
- ✅ Path class implementation
|
9
|
10
|
- ✅ createFastestPathFromNodes
|
10
|
11
|
- ✅ createShortestPathFromNodes
|
|
@@ -13,14 +14,17 @@
|
13
|
14
|
- ✅ getTravelTime
|
14
|
15
|
- ✅ getMinimumTravelTime
|
15
|
16
|
|
|
17
|
+
|
16
|
18
|
## Part 3
|
17
|
19
|
|
18
|
20
|
- ✅ [Second UML diagram](answers.md)
|
19
|
21
|
|
|
22
|
+
|
20
|
23
|
- ✅ BinaryHeap implementation
|
21
|
24
|
- ✅ implemented the remove() method
|
22
|
25
|
- ✅ improved the method by using a hashmap
|
23
|
26
|
|
|
27
|
+
|
24
|
28
|
- ✅ Created Label
|
25
|
29
|
- ✅ Attributes
|
26
|
30
|
- ✅ currNode
|
|
@@ -31,6 +35,7 @@
|
31
|
35
|
- ✅ getCost
|
32
|
36
|
- ✅ compareTo
|
33
|
37
|
|
|
38
|
+
|
34
|
39
|
- ✅ implemented Dijkstra
|
35
|
40
|
- ✅ handling special types of paths (pedestrians, car roads etc)
|
36
|
41
|
- ✅ added notifyNodeReached to show reached nodes on map
|
|
@@ -41,14 +46,17 @@
|
41
|
46
|
- ✅ Modified Label
|
42
|
47
|
- ✅ included getTotalCost
|
43
|
48
|
|
|
49
|
+
|
44
|
50
|
- ✅ Created LabelStar (inherits from Label)
|
45
|
51
|
- ✅ (new) Attributes
|
46
|
52
|
- ✅ crowCost
|
47
|
53
|
- ✅ Methods
|
48
|
54
|
- ✅ getTotalCost
|
49
|
55
|
|
|
56
|
+
|
50
|
57
|
- ✅ Modified Dijkstra (modularity)
|
51
|
58
|
|
|
59
|
+
|
52
|
60
|
- ✅ implemented A-Star
|
53
|
61
|
- ✅ built upon Dijkstra with another Label type
|
54
|
62
|
|