Created a maze solver using java. Implement DFS(Depth first search) algorithm to find the path to reach the destination point.
Depth first Search or Depth first traversal is a recursive algorithm for searching all the vertices of a graph or tree data structure. Traversal means visiting all the nodes of a graph.
