Solving Advent of Code with jq
A nice little Makefile driving each day too:<p><a href="https://github.com/odnoletkov/advent-of-code-jq/blob/master/Makefile" rel="nofollow">https://github.com/odnoletkov/advent-of-code-jq/blob/master/...</a><p>And I somehow just learned about asciicinema from it:<p><a href="https://asciinema.org" rel="nofollow">https://asciinema.org</a><p>This is parsing a maze into a graph and finding the shortest path:<p><a href="https://github.com/odnoletkov/advent-of-code-jq/blob/master/2022/12-1.jq" rel="nofollow">https://github.com/odnoletkov/advent-of-code-jq/blob/master/...</a><p>I can kinda make out how it's parsing the input and converting it to a graph. I can't make heads or tails of the path finding and I don't see anything that really looks like Djikstra's algorithm.