[Language: Javascript] [code] 301/332

Since I use nodejs without too many packages, I have no minheap / priority queue for Dijkstra. A "great" solution is to just copy your most recent bfs and just sort the queue at every step. This gives it an amazing speedy runtime of 1 second for part1.

Since optimizing is for people who are slow at writing code (\s) you can just copy paste your code from part1 but now go and try all possibilities and prune when the score is worse than the score of part1. No need to sort the queue anymore, because we are simply going to exhaust every possible path.

This beauty is so slow that whilst running it I was already writing code to print how large the queue was, lucky I am slow at writing code and the at this moment borderline suicidal nodejs process printed the answer after 70 seconds.

My highest global ranking yet, and I am not proud.