How to make a faster breadth first search?
<p>So, I was able to solve a 200x200 maze (just like pacman without any graphics) in 22 ms, on average. I used a linkedlist of nodes that four neighbours (up, right, left, and down). I have used a FileWriter, file reader, buffer methods, and used BFS algorithm to make a search from a start point to a goal. All these tasks took a total of 22 ms on a 200x200 maze, like mentioned earlier.
I was wondering if specifically using the Queue interface would help speed up the process. I know that LinkedList implements Queue, so I just used LinkedList. Any suggestions on making it faster?</p>

<p>NOTE: I tried my best to keep each method free from too many for loops. I have use two for loops only when I write a file. </p>
