[bhrgunatha]

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.

[vjerancrnjak]

For the input sizes in aoc, the slowdown shouldn't be measurable.

Taking input size into account, you do not even need a queue, just loops.