Commit graph

58 commits

Author SHA1 Message Date
f4db47ee4e feat(dijkstra): support double precision instead of float 2024-05-20 23:27:41 +02:00
6af2ae2ead refactor(test): use generic OSP algorithm 2024-05-20 22:59:31 +02:00
f852e39994 refactor(test): generalize shortestPathAlgorithmTest 2024-05-20 22:52:38 +02:00
8e7d933e7a refactor(shortestPath): move pathCost from Dijkstra to parent class for testing 2024-05-20 22:52:04 +02:00
f62e312156 refactor(test): dijkstra no path assertion 2024-05-20 22:26:22 +02:00
0ad795a8c4 refactor(test): for loop 2024-05-20 22:23:02 +02:00
5c248f26dc refactor(test): dijkstra bellman assertion 2024-05-20 22:21:34 +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
86b860f9a3 Tests Dijkstra 2024-05-18 16:00:13 +02:00
04f0e61c54 Tests Dijkstra, added chemins_courts, nuls, vélos, inexistant. Chemins long to be fixed 2024-05-18 12:57:06 +02:00
ed48a95832 Added paths + syntax for tests 2024-05-17 11:36:43 +02:00
1e3b3293a4 test(dijkstra): pcc toulouse insa 2024-05-17 08:55:55 +02:00
6db6644828 test(dijkstra): fix git mishap 2024-05-17 08:41:24 +02:00
0cfdaf1ef2 test(dijkstra): correct pathReader close placement 2024-05-17 08:39:13 +02:00
bbd6fac17f test(dijkstra): fix file paths 2024-05-17 08:35:48 +02:00
f289793c44 test(dijkstra): use static test class 2024-05-17 08:35:18 +02:00
72b117f83b test(dijkstra): fix before annotation on init 2024-05-17 07:54:19 +02:00
f6f431fce1 test(dijkstra): close open file readers 2024-05-17 07:53:17 +02:00
e728c77982 trying to test 2024-05-04 23:39:00 +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
632662ee75 test 2024-05-03 14:49:26 +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
7db072a9f7 wip(dijkstra): tests 2024-04-05 12:08:20 +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