Commit Graph

7 Commits

Author SHA1 Message Date
cfb3ae497e Reformatted 2023-05-26 10:02:22 +02:00
b480601ee8 clippy fixes
clippy fixes #2

clippy fixed #3

removed unnecessary stuff
2023-05-20 23:28:37 +02:00
Johannes
ba622fd408 day15 part 2 optimized
instead of senselessly trying to find the best starting point, just rely
on the order of neighbor point generation. Since we use a queue
to manage open points and he neighbors are added in the correct
order, they neighbor that has precedence due to reading order will
automatically be the one to be predecessor on a final path, if he is on
a shortest path.
2018-12-18 22:43:10 +01:00
Johannes
cef96d55be day15 part 2 2018-12-18 22:20:03 +01:00
Johannes
3f2ff6e5a2 day15 part1 done 2018-12-18 19:11:55 +01:00
Johannes Schaefer
ac3a741f0d day15 part1 combat with errors 2018-12-18 17:46:44 +01:00
Johannes Schaefer
2bf8edf315 day15 part1 movement 2018-12-18 16:59:41 +01:00