A graphical depiction of the breadth-first serach algorithm using the Java Swing library.
words.txt contains a list of Points. Each Point represents the location of a wall in the simulation. Modify this text file to your liking.
This program expects four arguments in the form x1 y1 x2 y2. For example, to find the shortest path between (0,0) and (5,3) you would run java -jar bfs.jar 0 0 5 3
[