|
|
bed0f37cfa
|
Before big modif
|
2024-05-21 19:08:11 +02:00 |
|
|
|
7545364b39
|
feat(time-trial): output csv data
|
2024-05-21 18:17:47 +02:00 |
|
|
|
e4c6f656f9
|
feat(time-trial): add time trial
|
2024-05-21 17:25:43 +02:00 |
|
|
|
fd69c3b30c
|
fix(dijkstra): path reconstruction not choosing optimal arc
|
2024-05-20 23:55:01 +02:00 |
|
|
|
f4db47ee4e
|
feat(dijkstra): support double precision instead of float
|
2024-05-20 23:27:41 +02:00 |
|
|
|
8e7d933e7a
|
refactor(shortestPath): move pathCost from Dijkstra to parent class for testing
|
2024-05-20 22:52:04 +02:00 |
|
|
|
add3470b71
|
conflict fix
|
2024-05-20 01:42:54 +02:00 |
|
|
|
2ec3d4200f
|
Edge case fix + Astar Time mode
|
2024-05-20 00:31:13 +02:00 |
|
|
|
436d69db1b
|
Adress case: En cas d'égalité, on considèrera en premier le sommet ayant le plus petit coût estimé à la destination.
|
2024-05-19 23:05:42 +02:00 |
|
|
|
c60efbc5a5
|
Tests Dijkstra (TIME) and added some paths
|
2024-05-18 18:29:08 +02:00 |
|
|
|
1c4bc2fb00
|
TIME mode
|
2024-05-18 17:05:39 +02:00 |
|
|
|
de65f817b1
|
Added getPathCost method and pathCost attribute
|
2024-05-18 16:08:28 +02:00 |
|
|
|
b45ff5d930
|
dijkstra verifications OK
|
2024-05-04 22:32:08 +02:00 |
|
|
|
df55fb1472
|
fix(astar): compareto using sign for better precision
|
2024-05-03 15:09:28 +02:00 |
|
|
|
f77aea0371
|
feat(astar): create labels by algorithm
|
2024-05-03 15:02:31 +02:00 |
|
|
|
24012e3afc
|
feat(astar): compare total cost
|
2024-05-03 14:46:33 +02:00 |
|
|
|
a0c6437bd2
|
feat(astar): create class labelstar
|
2024-05-03 14:46:18 +02:00 |
|
|
|
224ab4a97d
|
fix(dijkstra): filter invalid arcs during reconstruction
|
2024-05-03 13:58:13 +02:00 |
|
|
|
5363dd1a89
|
fix(dijkstra): remove then insert to sort bin heap
|
2024-05-03 13:57:54 +02:00 |
|
|
|
6baec1d7dd
|
feat(dijkstra): mark labels as reached to increase performance
|
2024-05-03 13:24:05 +02:00 |
|
|
|
dcc2bc0746
|
fix(dijkstra): observers
|
2024-05-03 12:52:29 +02:00 |
|
|
|
c223936743
|
feat: add bicycle filter
|
2024-04-26 18:24:06 +02:00 |
|
|
|
429a22fcd9
|
roads allowed feat
|
2024-04-26 17:52:28 +02:00 |
|
|
|
5dfd14f3f2
|
doc(dijkstra): explain why we use an ArrayList
|
2024-04-26 17:35:37 +02:00 |
|
|
|
e5be8087f9
|
dijkstra functional
|
2024-04-26 17:31:33 +02:00 |
|
|
|
73a1e4a058
|
dijkstra
|
2024-04-26 17:10:49 +02:00 |
|
|
|
9e994c2104
|
access labels node
|
2024-04-26 16:55:23 +02:00 |
|
|
|
ceeb5e1203
|
dijkstra: functional
|
2024-04-20 19:21:26 +02:00 |
|
|
|
26e5d5dac9
|
dijkstra: functional
|
2024-04-20 19:18:04 +02:00 |
|
|
|
6e4c4de7dd
|
dijkstra : compiling version but not functional
|
2024-04-18 01:16:09 +02:00 |
|
|
|
f51d3a26b5
|
few fixes: dijkstra
|
2024-04-18 01:05:14 +02:00 |
|
|
|
4bd0c74fa4
|
dijkstra, not functional
|
2024-04-05 12:38:18 +02:00 |
|
|
|
7e0955ecb2
|
feat(dijkstra): implement Comparable in Label class
|
2024-04-05 11:47:05 +02:00 |
|
|
|
19ec6b6220
|
feat(dijkstra): write label class
|
2024-04-05 11:34:12 +02:00 |
|
|
|
cce3fcdca8
|
feat(binheap): remove passes tests
|
2024-04-05 10:51:13 +02:00 |
|
|
|
04c4316e36
|
wip(binheap): remove
|
2024-04-05 09:46:28 +02:00 |
|
|
|
c68a969b91
|
Edge cases to fix
|
2024-04-05 00:55:52 +02:00 |
|
|
|
2e20b9b3a6
|
heap removed impl, tests to fix
|
2024-04-05 00:37:26 +02:00 |
|
Le Botlan Didier
|
32f99dba49
|
Nodes are no longer comparable (confusion with Label comparison). Predefined ArcInspectors easier to get.
|
2024-03-22 17:07:18 +01:00 |
|
Didier Le Botlan
|
8675c420a8
|
Unused imports
|
2023-03-07 12:08:34 +01:00 |
|
Le Botlan Didier
|
dd5ed04891
|
annotation javadoc
|
2022-03-25 08:19:08 +01:00 |
|
Le Botlan Didier
|
1f28a33da4
|
Removed getMaximumSpeed in Data.
|
2022-03-01 17:14:58 +01:00 |
|
Mikaël Capelle
|
5bb454a3b2
|
Switch to Maven project.
|
2020-02-27 21:09:05 +01:00 |
|
