Solving Advent of Code with jq
A nice little Makefile driving each day too:https://github.com/odnoletkov/advent-of-code-jq/blob/master/...And I somehow just learned about asciicinema from it:https://asciinema.orgThis is parsing a maze into a graph and finding the shortest path:https://github.com/odnoletkov/advent-of-code-jq/blob/master/...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.