Shortest Path Algorithm via Exhaustive Depth First Search in Java
Part II, Advanced Programming, A
Had to demonstrate a mix of algorithmic problem solving for pathfinding and correct OOP understanding. The program that used our class (MazeSquare) would generate a maze and we had to make it so a user could decide a start and end point and the program would have to find the shortest path if possible but using a depth first fashion.