Commit graph

Select branches

Hide pull requests

master

Mono Color

• 0dbe233d75 feat(marathon): display path-finding on gui master Paul ALNET 2024-05-26 11:19:02 +0200
• d6f469e32f feat(time-trial): add maps Paul ALNET 2024-05-25 22:57:35 +0200
• db889e56e4 refactor(time-trial): move test run to own function Paul ALNET 2024-05-25 21:58:06 +0200
• 4c71453889 chore(time-trial): remove final ms count display Paul ALNET 2024-05-25 21:35:55 +0200
• 3f7a1543fd Tests pass: 11 minutes Clement LACAU 2024-05-25 22:49:47 +0200
• 3095e3e08c Tests Belgique + param tolerance Clement LACAU 2024-05-25 22:27:34 +0200
• a5b553e712 perf(dijkstra): create labels dynamically Paul ALNET 2024-05-25 21:20:03 +0200
• 8fa1d62d02 Update sur la fiche de synthèse Clement LACAU 2024-05-25 19:49:31 +0200
• 0d9b2e450c chore: remove unused imports Paul ALNET 2024-05-25 17:44:44 +0200
• eaa80d87fa refactor(marathon): getRandomArc to own function Paul ALNET 2024-05-25 17:41:11 +0200
• 51c2c8b29e chore(path): restore getArcs immutability Paul ALNET 2024-05-25 17:31:15 +0200
• 9c47703bc4 feat(path): add replaceArc method Paul ALNET 2024-05-25 17:29:43 +0200
• 7cc3c39211 feat(marathon): use marathonArcInspector Paul ALNET 2024-05-25 17:29:19 +0200
• b7012ee892 feat(marathon): add marathonArcInspector Paul ALNET 2024-05-25 17:28:08 +0200
• f45f0027f0 refactor(marathon): make constant references as final Paul ALNET 2024-05-25 15:38:14 +0200
• de340c65dd refactor(marathon): rename solution to more coherent naming schema Paul ALNET 2024-05-25 15:25:51 +0200
• 63da86ab0f refactor(marathon): find next arc to remove to own function Paul ALNET 2024-05-25 15:15:35 +0200
• 26a662bb1b refactor(marathon): remove unused imports & variables Paul ALNET 2024-05-25 14:57:01 +0200
• d0e970b2ab revert(model): Path.concatenate Paul ALNET 2024-05-25 14:47:56 +0200
• 8f7639cea4 doc(model): comment Node.removeArc Paul ALNET 2024-05-25 14:47:40 +0200
• 69ebb4fd01 permettre la modification des successeurs du node pour l'algo marathon Clement LACAU 2024-05-24 23:39:38 +0200
• fd6b03a32c Permettre la modification de la liste d'arcs du path pour l'algo marathon Clement LACAU 2024-05-24 23:39:15 +0200
• f3bb926fda ajout algo marathon en choix d'algo shortest path Clement LACAU 2024-05-24 23:38:39 +0200
• 0979e10f41 Algo Marathon: chemins très centrés sur départ/arrivée Clement LACAU 2024-05-24 23:38:18 +0200
• ae73970aff wip(marathon): algo Paul ALNET 2024-05-24 15:48:18 +0200
• 386a227978 perf(astar): calculate distance on the fly instead of on init Paul ALNET 2024-05-24 14:57:29 +0200
• a75f05b9a3 Commentaire comparaison arcs Clement LACAU 2024-05-24 14:00:53 +0200
• 44991cfab2 Test: sous pcc est un pcc : vérification arcs Clement LACAU 2024-05-24 13:58:56 +0200
• 45adcbeb8e All validity tests Clement LACAU 2024-05-22 01:05:05 +0200
• 1e183cedf8 Dijkstra fixed, all tests pass Clement LACAU 2024-05-21 21:46:09 +0200
• 0e576e534b From parentnode to parentarc Clement LACAU 2024-05-21 19:08:04 +0200
• bed0f37cfa Before big modif Clement LACAU 2024-05-21 17:56:24 +0200
• 7545364b39 feat(time-trial): output csv data Paul ALNET 2024-05-21 18:17:47 +0200
• 017d65f57c doc(test): mention optimality Paul ALNET 2024-05-21 17:25:56 +0200
• e4c6f656f9 feat(time-trial): add time trial Paul ALNET 2024-05-21 17:23:42 +0200
• d7c938cc76 All tests are valid Clement LACAU 2024-05-21 01:07:41 +0200
• 76e734919c Added 2 tests: comparision with dijkstra in time and length modes Clement LACAU 2024-05-21 01:06:24 +0200
• 8e111e2bbf Added .path and .json Clement LACAU 2024-05-20 23:58:16 +0200
• 205605920b feat(gui): display number of arcs for paths Paul ALNET 2024-05-21 00:30:16 +0200
• 5b59292839 doc(test): explain imprecisions with very long paths Paul ALNET 2024-05-21 00:24:08 +0200
• fd69c3b30c fix(dijkstra): path reconstruction not choosing optimal arc Paul ALNET 2024-05-20 23:55:01 +0200
• f4db47ee4e feat(dijkstra): support double precision instead of float Paul ALNET 2024-05-20 23:27:41 +0200
• 6af2ae2ead refactor(test): use generic OSP algorithm Paul ALNET 2024-05-20 22:59:31 +0200
• f852e39994 refactor(test): generalize shortestPathAlgorithmTest Paul ALNET 2024-05-20 22:52:38 +0200
• 8e7d933e7a refactor(shortestPath): move pathCost from Dijkstra to parent class for testing Paul ALNET 2024-05-20 22:52:04 +0200
• f62e312156 refactor(test): dijkstra no path assertion Paul ALNET 2024-05-20 22:26:13 +0200
• 0ad795a8c4 refactor(test): for loop Paul ALNET 2024-05-20 22:23:02 +0200
• 5c248f26dc refactor(test): dijkstra bellman assertion Paul ALNET 2024-05-20 22:21:34 +0200
• e4f9a18f22 doc(marathon): add path constrains and algo ideas Paul ALNET 2024-05-20 21:59:17 +0200
• add3470b71 conflict fix Clement LACAU 2024-05-20 01:42:54 +0200
• 2ec3d4200f Edge case fix + Astar Time mode Clement LACAU 2024-05-20 00:31:13 +0200
• 436d69db1b Adress case: En cas d'égalité, on considèrera en premier le sommet ayant le plus petit coût estimé à la destination. Clement LACAU 2024-05-19 23:05:42 +0200
• c60efbc5a5 Tests Dijkstra (TIME) and added some paths Clement LACAU 2024-05-18 18:29:08 +0200
• 1c4bc2fb00 TIME mode Clement LACAU 2024-05-18 17:05:39 +0200
• de65f817b1 Added getPathCost method and pathCost attribute Clement LACAU 2024-05-18 16:08:28 +0200
• 86b860f9a3 Tests Dijkstra Clement LACAU 2024-05-18 16:00:13 +0200
• 04f0e61c54 Tests Dijkstra, added chemins_courts, nuls, vélos, inexistant. Chemins long to be fixed Clement LACAU 2024-05-18 12:57:06 +0200
• ed48a95832 Added paths + syntax for tests Clement LACAU 2024-05-17 11:36:43 +0200
• 1e3b3293a4 test(dijkstra): pcc toulouse insa Paul ALNET 2024-05-17 08:55:55 +0200
• 6db6644828 test(dijkstra): fix git mishap Paul ALNET 2024-05-17 08:41:24 +0200
• 0cfdaf1ef2 test(dijkstra): correct pathReader close placement Paul ALNET 2024-05-17 08:39:13 +0200
• bbd6fac17f test(dijkstra): fix file paths Paul ALNET 2024-05-17 08:35:48 +0200
• f289793c44 test(dijkstra): use static test class Paul ALNET 2024-05-17 08:35:18 +0200
• 72b117f83b test(dijkstra): fix before annotation on init Paul ALNET 2024-05-17 07:54:19 +0200
• f6f431fce1 test(dijkstra): close open file readers Paul ALNET 2024-05-17 07:53:17 +0200
• e728c77982 trying to test Clement LACAU 2024-05-04 23:39:00 +0200
• b45ff5d930 dijkstra verifications OK Clement LACAU 2024-05-04 22:32:08 +0200
• df55fb1472 fix(astar): compareto using sign for better precision Paul ALNET 2024-05-03 15:09:28 +0200
• f77aea0371 feat(astar): create labels by algorithm Paul ALNET 2024-05-03 15:02:21 +0200
• 632662ee75 test Clement LACAU 2024-05-03 14:49:19 +0200
• 24012e3afc feat(astar): compare total cost Paul ALNET 2024-05-03 14:46:33 +0200
• a0c6437bd2 feat(astar): create class labelstar Paul ALNET 2024-05-03 14:46:18 +0200
• 224ab4a97d fix(dijkstra): filter invalid arcs during reconstruction Paul ALNET 2024-05-03 13:58:13 +0200
• 5363dd1a89 fix(dijkstra): remove then insert to sort bin heap Paul ALNET 2024-05-03 13:57:54 +0200
• 6baec1d7dd feat(dijkstra): mark labels as reached to increase performance Paul ALNET 2024-05-03 13:24:05 +0200
• dcc2bc0746 fix(dijkstra): observers Paul ALNET 2024-05-03 12:52:29 +0200
• c223936743 feat: add bicycle filter Paul ALNET 2024-04-26 18:24:06 +0200
• 429a22fcd9 roads allowed feat Clement LACAU 2024-04-26 17:52:00 +0200
• 5dfd14f3f2 doc(dijkstra): explain why we use an ArrayList Paul ALNET 2024-04-26 17:35:37 +0200
• e5be8087f9 dijkstra functional Clement LACAU 2024-04-26 17:31:33 +0200
• 73a1e4a058 dijkstra Clement LACAU 2024-04-26 17:10:49 +0200
• 9e994c2104 access labels node Clement LACAU 2024-04-26 16:55:23 +0200
• ceeb5e1203 dijkstra: functional Clement LACAU 2024-04-20 19:21:26 +0200
• 26e5d5dac9 dijkstra: functional Clement LACAU 2024-04-20 19:18:04 +0200
• 6e4c4de7dd dijkstra : compiling version but not functional Clement LACAU 2024-04-18 01:16:09 +0200
• f51d3a26b5 few fixes: dijkstra Clement LACAU 2024-04-18 01:05:14 +0200
• 4bd0c74fa4 dijkstra, not functional Clement LACAU 2024-04-05 12:38:13 +0200
• 7db072a9f7 wip(dijkstra): tests Paul ALNET 2024-04-05 12:08:20 +0200
• 7e0955ecb2 feat(dijkstra): implement Comparable in Label class Paul ALNET 2024-04-05 11:47:05 +0200
• 19ec6b6220 feat(dijkstra): write label class Paul ALNET 2024-04-05 11:33:58 +0200
• 04626fb1a7 UML algos Clement LACAU 2024-04-05 11:08:16 +0200
• cce3fcdca8 feat(binheap): remove passes tests Paul ALNET 2024-04-05 10:51:13 +0200
• 04c4316e36 wip(binheap): remove Paul ALNET 2024-04-05 09:46:28 +0200
• e45e83dc69 fix(launch): use relative file paths Paul ALNET 2024-04-05 08:28:58 +0200
• c68a969b91 Edge cases to fix Clement LACAU 2024-04-05 00:55:52 +0200
• 2e20b9b3a6 heap removed impl, tests to fix Clement LACAU 2024-04-05 00:37:26 +0200
• cf4f368912 Launch Java: insa map, rangueil path Clement LACAU 2024-04-03 13:50:26 +0200
• a75c0f18c9 launch.java Clement LACAU 2024-03-25 10:53:55 +0100
• 43931e3d05 chore(path): remove isValid deprecation flag Paul ALNET 2024-03-25 10:44:04 +0100
• 89fe1293d3 feat(path): implement getShortestPathFromNodes Paul ALNET 2024-03-25 10:43:16 +0100