mirror of
https://github.com/parnic/advent-of-code-2022.git
synced 2025-06-16 05:30:14 -05:00
Parnic
61227ba688
This enables a flood-fill of distances from the goal location to every other location on the grid. With that, we only have to locate the node with the lowest distance value. Technically this also solves part 1, but I wanted to leave the forward search in place as a test of sorts that the algorithm works both ways. Now if I can just get the parse sped up...
Advent of Code 2022
My solutions to Advent of Code 2022.