Implement first version of DFS

main.cc

@@ -119,20 +119,38 @@ class World
 		bool dfs(unsigned int s0, unsigned int t, list<unsigned int>& path)
 		{
 			bool r = false;
-                        int current = s0;
 
                         bool explored[size];
 
                         stack<unsigned int> open;
+			open.push(s0);
 
                         for (unsigned int k(0); k < size; k ++)
                             explored[k] = false;
 
                         explored[s0] = true;
 
+                        int current;
+			int neighbour;
+			unsigned int succs[4];
+			unsigned int nbSuccs;
+
                         do {
+				current = open.top();
+				open.pop();
+
+				nbSuccs = successors(current, succs);
+
+				for (unsigned int i(0); i < nbSuccs; i++) {
+					neighbour = succs[i];
+
+					if (!explored[neighbour])
+						open.push(neighbour);
+				}
+
+				// Build path
+				path.push_back(current);
 
-                            // todo ...
 
                         } while (!r && !open.empty());