Retrait logs DFS + clean build

Author: Gabriel Derrien

bin/.gitignore

@@ -0,0 +1,9 @@
+/AStarSolver$1.class
+/AStarSolver$2.class
+/AStarSolver.class
+/BFS_Solver.class
+/DFS_Solver.class
+/Main.class
+/Maze.class
+/Node.class
+/Square.class

bin/DFS_Solver.class

@@ -54,8 +54,6 @@ public void solve()
 				Node<Maze> current = this.frontier.pop(); //Get first node from the frontier
 				this.maze = (Maze) current.getContent();
 				Square currState = this.maze.getCurrState();
-			
-				System.out.println(this.maze.printMaze());
 
 				if(currState.getLine() == this.maze.getEnd().getLine() && currState.getCol() == this.maze.getEnd().getCol())
 				{
@@ -84,7 +82,6 @@ public void solve()
 						this.nodesCounter++;
 					}
 				}
-				System.out.println(this.frontier.toString());
 			}
 		}
 
@@ -109,7 +106,6 @@ public LinkedList<Node<Maze>> getNextSquares()
 			Square tempSq = nexts.get(i).getCurrState();
 			if(!this.closedSquares.contains(tempSq))
 			{
-				//this.closedSquares.push(tempSq);
 				Node<Maze> tempNode = new Node<Maze>(nexts.get(i));
 				res.add(tempNode);
 			}

bin/Main.class

@@ -22,7 +22,7 @@ public static void main(String[] args) throws IOException
 		//====================
 		//====================
 
-		Maze lab2 = new Maze("./data/lab_samuel.txt");
+		Maze lab2 = new Maze("./data/lab.txt");
 
 		//char[] order = {'N', 'W', 'S', 'E'};
 		//lab2.setOrder(order);