3 ms·
I suspect it’s a breadth-first search, which is substantially easier to code. .front looks like the queue of nodes to visit.
by nneonneo 4y ago
I suspect it’s a breadth-first search, which is substantially easier to code. .front looks like the queue of nodes to visit.
- bhrgunatha 4y agoYou 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 4y agoFor 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.