|
|
f3bb926fda
|
ajout algo marathon en choix d'algo shortest path
|
2024-05-24 23:38:39 +02:00 |
|
|
|
0979e10f41
|
Algo Marathon: chemins très centrés sur départ/arrivée
|
2024-05-24 23:38:18 +02:00 |
|
|
|
ae73970aff
|
wip(marathon): algo
|
2024-05-24 15:48:18 +02:00 |
|
|
|
386a227978
|
perf(astar): calculate distance on the fly instead of on init
|
2024-05-24 14:57:29 +02:00 |
|
|
|
a75f05b9a3
|
Commentaire comparaison arcs
|
2024-05-24 14:00:53 +02:00 |
|
|
|
44991cfab2
|
Test: sous pcc est un pcc : vérification arcs
|
2024-05-24 13:58:56 +02:00 |
|
|
|
45adcbeb8e
|
All validity tests
|
2024-05-22 01:05:05 +02:00 |
|
|
|
1e183cedf8
|
Dijkstra fixed, all tests pass
|
2024-05-21 21:46:09 +02:00 |
|
|
|
0e576e534b
|
From parentnode to parentarc
|
2024-05-21 19:08:11 +02:00 |
|
|
|
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 |
|
|
|
017d65f57c
|
doc(test): mention optimality
|
2024-05-21 17:25:56 +02:00 |
|
|
|
e4c6f656f9
|
feat(time-trial): add time trial
|
2024-05-21 17:25:43 +02:00 |
|
|
|
d7c938cc76
|
All tests are valid
|
2024-05-21 01:07:46 +02:00 |
|
|
|
76e734919c
|
Added 2 tests: comparision with dijkstra in time and length modes
|
2024-05-21 01:07:46 +02:00 |
|
|
|
5b59292839
|
doc(test): explain imprecisions with very long paths
|
2024-05-21 00:24:08 +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 |
|
|
|
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 |
|
