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.
You would hope so. Saw many people on r/adventofcode using dijkstra or even A* when every path step is just 1. I went with bfs because I'm pretty sure using a priority queue or heuristic function is going to slow those down.
https://github.com/odnoletkov/advent-of-code-jq/blob/master/...
And I somehow just learned about asciicinema from it:
https://asciinema.org
This 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.