Christopher Ansbach's Digital Portfolio

This program generates a maze of specified size and then finds the end by using the breadth first and depth first search algorithms. If no path is available, the program will output "No Path." The repository contains the java class files needed for the program to run in an IDE.

While making this project I increased by understanding of the breadth first and depth first search algorithms and their possible application in the real world when it comes to searching for data in an array.