Wrote code to find the diameter of the maze, i.e. the longest amongst all of the shortest paths.
I tried a number of algorithms for this, but just performing BFS from every node, while still being annoyingly slow (> 2 mins for a 100 x 100 DFS maze), was the fastest.
I am hoping that we can use #120 to improve the speed.
Wrote code to find the diameter of the maze, i.e. the longest amongst all of the shortest paths.
I tried a number of algorithms for this, but just performing BFS from every node, while still being annoyingly slow (> 2 mins for a 100 x 100 DFS maze), was the fastest.
I am hoping that we can use #120 to improve the speed.