title: Solving a maze using depth first search algorithm
body: <p>So I have this school project:
  I am given as input a maze and I have to solve it. I thought of using the DFS algorithm to do so.</p>
  
  <p>What I have done so far is transform my maze into a graph, in which the vertices are the non-wall positions of the maze.</p>
  
  <p>I found some pseudocode for DFS online. I implemented it, but I don't understand how I am supposed to get a path out of it. The pseudocode of the algorithm is :</p>
  
  <pre><code>   dfs(graph G,vertex a)
     {
        ColorNode(a);
        for all vertices e adjacent to a
        {
          if e is endpoint
           END
          if e is not colored
           dfs(G, e)
        }  
      }
  </code></pre>
  
  <p>With this algorithm, all the nodes end up being colored..
  If someone could give me a hand here, it would be really nice!</p>