Nightmare for Python coders
I bothered to try different Python algorithms on the forum. Only the one which used A passes reliably. I also tried to optimize my BFS code, comparing heap vs s
I bothered to try different Python algorithms on the forum. Only the one which used A* passes reliably. I also tried to optimize my BFS code, comparing heap vs sort, and using set vs array to store visited (array seems to be a little faster). None of them yield a big difference.\n\nI found that a monstrous testcase (54) causes similar amount of time between A* and BFS, but A* is consistently faster than BFS in earlier testcases.
[]