 Zelphir Kaltstahl
|
0d5447e331
solve part 2 in elixir
|
1 éve |
|
Zelphir Kaltstahl
|
883b9a0720
solve day 03 part 01 in elixir
|
1 éve |
|
Zelphir Kaltstahl
|
b61661f11b
prepare for day 3
|
1 éve |
|
Zelphir Kaltstahl
|
39bb5d9032
add part 2
|
1 éve |
|
Zelphir Kaltstahl
|
a9e93eb91a
start with day 02
|
1 éve |
|
Zelphir Kaltstahl
|
f9bec91716
add elixir solution
|
1 éve |
|
Zelphir Kaltstahl
|
f230e5c3a1
move forth solution to subdirectory
|
1 éve |
|
Zelphir Kaltstahl
|
2bbdbc23b9
WIP commit
|
1 éve |
|
Zelphir Kaltstahl
|
9313994141
improve docstrings
|
1 éve |
|
Zelphir Kaltstahl
|
7d38b7b2a0
copy pasta wip
|
1 éve |
|
Zelphir Kaltstahl
|
99acfe7884
remove empty lines
|
1 éve |
|
Zelphir Kaltstahl
|
6b7031743e
fix wrong variable names
|
1 éve |
|
Zelphir Kaltstahl
|
9e22d230af
add example graph and stub for test file
|
1 éve |
|
Zelphir Kaltstahl
|
f8d5694bf0
try implementing A*
|
1 éve |
|
Zelphir Kaltstahl
|
43857783c5
add thoughts
|
1 éve |
|
Zelphir Kaltstahl
|
4387e0ea5c
output
|
1 éve |
|
Zelphir Kaltstahl
|
8f290cb3fc
add function to actually get a path from start node to target node
|
1 éve |
|
Zelphir Kaltstahl
|
6be0ae60a8
calculate shortest path from AA to all other nodes
|
1 éve |
|
Zelphir Kaltstahl
|
549776310b
add an even more minimal input
|
1 éve |
|
Zelphir Kaltstahl
|
404f11d91b
implement Dijkstra shortest path
|
1 éve |
|
Zelphir Kaltstahl
|
7ce08a2180
start implementing day 16 naively
|
1 éve |
|
Zelphir Kaltstahl
|
63b2e6b48a
cleanup
|
1 éve |
|
Zelphir Kaltstahl
|
27747d7e7f
solve day 15 part 02
|
1 éve |
|
Zelphir Kaltstahl
|
4f828aa847
solve day 15 part 01
|
1 éve |
|
Zelphir Kaltstahl
|
b0ad68f35c
cleanup
|
1 éve |
|
Zelphir Kaltstahl
|
1d301291ca
clean up
|
1 éve |
|
Zelphir Kaltstahl
|
0fd7da81a9
solve for example input of part 01
|
1 éve |
|
Zelphir Kaltstahl
|
ff632d80eb
implement segment calculation
|
1 éve |
|
Zelphir Kaltstahl
|
b5faa12b61
make code neater and visualize example field
|
1 éve |
|
Zelphir Kaltstahl
|
7d42974895
begin implementing day 15 part 01
|
1 éve |
