|
|
0d9b2e450c
|
chore: remove unused imports
|
2024-05-25 17:44:44 +02:00 |
|
|
|
eaa80d87fa
|
refactor(marathon): getRandomArc to own function
|
2024-05-25 17:41:46 +02:00 |
|
|
|
51c2c8b29e
|
chore(path): restore getArcs immutability
|
2024-05-25 17:41:46 +02:00 |
|
|
|
9c47703bc4
|
feat(path): add replaceArc method
|
2024-05-25 17:34:55 +02:00 |
|
|
|
7cc3c39211
|
feat(marathon): use marathonArcInspector
|
2024-05-25 17:34:55 +02:00 |
|
|
|
b7012ee892
|
feat(marathon): add marathonArcInspector
|
2024-05-25 17:28:08 +02:00 |
|
|
|
f45f0027f0
|
refactor(marathon): make constant references as final
|
2024-05-25 15:38:55 +02:00 |
|
|
|
de340c65dd
|
refactor(marathon): rename solution to more coherent naming schema
|
2024-05-25 15:25:51 +02:00 |
|
|
|
63da86ab0f
|
refactor(marathon): find next arc to remove to own function
|
2024-05-25 15:17:22 +02:00 |
|
|
|
26a662bb1b
|
refactor(marathon): remove unused imports & variables
|
2024-05-25 14:57:01 +02:00 |
|
|
|
d0e970b2ab
|
revert(model): Path.concatenate
|
2024-05-25 14:47:56 +02:00 |
|
|
|
8f7639cea4
|
doc(model): comment Node.removeArc
|
2024-05-25 14:47:40 +02:00 |
|
|
|
69ebb4fd01
|
permettre la modification des successeurs du node pour l'algo marathon
|
2024-05-24 23:39:38 +02:00 |
|
|
|
fd6b03a32c
|
Permettre la modification de la liste d'arcs du path pour l'algo marathon
|
2024-05-24 23:39:15 +02:00 |
|
|
|
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 |
|
|
|
8e111e2bbf
|
Added .path and .json
|
2024-05-21 01:07:46 +02:00 |
|
|
|
205605920b
|
feat(gui): display number of arcs for paths
|
2024-05-21 00:30:16 +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 |
|
|
|
e4f9a18f22
|
doc(marathon): add path constrains and algo ideas
|
2024-05-20 21:59:17 +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 |
|
