Board true deep copy Constructor and createInnerWalls small bug

src/host/labyrinth/Common.java

@@ -314,7 +314,7 @@ class Edge {
  * of the closed room into the problem of finding a non simple graph.
  *
  * If the board has non connected wall structure then we would need a non
- * coherent graph to represent it. This class provides constroctors and
+ * coherent graph to represent it. This class provides constructors and
  * methods to create coherent graphs
  * 
  * An example of the biggest coherent graph we can create from the board bellow,
@@ -330,7 +330,7 @@ class Edge {
 class Graph {
    /**
     * Constructs a node of the graph using the value of a vertex(node).
-    * @param v    The verteg to attach.
+    * @param v    The vertex to attach.
     */
    Graph (int v) {
       V = v;