Paul Alnet alnet
  • Joined on 2021-09-11
alnet pushed to master at alnet/demo-git-202410 2024-10-10 14:43:03 +02:00
00e73e3d9f fix: c'est bob
alnet pushed to master at alnet/demo-git-202410 2024-10-10 14:38:01 +02:00
d342d2112c feat: rajout hello
alnet created repository alnet/demo-git-202410 2024-10-10 13:36:59 +02:00
alnet pushed to master at lacau/BE_Graphes 2024-05-26 11:19:22 +02:00
0dbe233d75 feat(marathon): display path-finding on gui
alnet pushed to master at lacau/BE_Graphes 2024-05-25 22:57:47 +02:00
d6f469e32f feat(time-trial): add maps
db889e56e4 refactor(time-trial): move test run to own function
4c71453889 chore(time-trial): remove final ms count display
Compare 3 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-25 21:20:12 +02:00
a5b553e712 perf(dijkstra): create labels dynamically
alnet pushed to master at lacau/BE_Graphes 2024-05-25 17:44:54 +02:00
0d9b2e450c chore: remove unused imports
eaa80d87fa refactor(marathon): getRandomArc to own function
51c2c8b29e chore(path): restore getArcs immutability
9c47703bc4 feat(path): add replaceArc method
7cc3c39211 feat(marathon): use marathonArcInspector
Compare 10 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-25 14:48:05 +02:00
d0e970b2ab revert(model): Path.concatenate
8f7639cea4 doc(model): comment Node.removeArc
Compare 2 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-24 15:48:26 +02:00
ae73970aff wip(marathon): algo
alnet pushed to master at lacau/BE_Graphes 2024-05-24 14:57:38 +02:00
386a227978 perf(astar): calculate distance on the fly instead of on init
alnet pushed to master at lacau/BE_Graphes 2024-05-21 18:17:56 +02:00
7545364b39 feat(time-trial): output csv data
alnet pushed to master at lacau/BE_Graphes 2024-05-21 17:26:05 +02:00
017d65f57c doc(test): mention optimality
e4c6f656f9 feat(time-trial): add time trial
Compare 2 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-21 00:30:26 +02:00
205605920b feat(gui): display number of arcs for paths
alnet pushed to master at lacau/BE_Graphes 2024-05-21 00:24:20 +02:00
5b59292839 doc(test): explain imprecisions with very long paths
alnet pushed to master at lacau/BE_Graphes 2024-05-20 23:55:10 +02:00
fd69c3b30c fix(dijkstra): path reconstruction not choosing optimal arc
alnet pushed to master at lacau/BE_Graphes 2024-05-20 23:27:49 +02:00
f4db47ee4e feat(dijkstra): support double precision instead of float
alnet pushed to master at lacau/BE_Graphes 2024-05-20 23:09:17 +02:00
6af2ae2ead refactor(test): use generic OSP algorithm
f852e39994 refactor(test): generalize shortestPathAlgorithmTest
8e7d933e7a refactor(shortestPath): move pathCost from Dijkstra to parent class for testing
Compare 3 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-20 22:32:18 +02:00
f62e312156 refactor(test): dijkstra no path assertion
0ad795a8c4 refactor(test): for loop
5c248f26dc refactor(test): dijkstra bellman assertion
Compare 3 commits »
alnet pushed to master at lacau/BE_Graphes 2024-05-20 21:59:25 +02:00
e4f9a18f22 doc(marathon): add path constrains and algo ideas
alnet pushed to master at lacau/BE_Graphes 2024-05-17 08:56:08 +02:00
1e3b3293a4 test(dijkstra): pcc toulouse insa