modified: src/GraphClasses/Complete.java

	modified:   src/GraphClasses/Grid.java
	modified:   src/Main.java

src/GraphClasses/Complete.java

 package GraphClasses;
+
 import Graph.*;
 
 public class Complete {
@@ -13,7 +14,4 @@ public class Complete {
 
     }
 
-	
-	
-	
 }

src/GraphClasses/Grid.java

 package GraphClasses;
+
 import Graph.*;
 
 import java.util.BitSet;
@@ -28,7 +29,7 @@ public class Grid {
         this.width = width;
         this.height = height;
         maxVertex = width * height - 1;
-		graph = new Graph(maxVertex);
+        graph = new Graph(maxVertex + 1);
         for (int i = 0; i < width; i++) {
             for (int j = 0; j < height; j++) {
                 if (i < width - 1)

src/Main.java

@@ -42,7 +42,7 @@ public class Main {
         //Graph graph = new Complete(400).graph;
         //Graph graph = new ErdosRenyi(1_000, 100).graph;
         //Graph graph = new Lollipop(1_000).graph;
-        return grid.graph;
+        return graph;
     }
 
     public static ArrayList<Edge> genTree(Graph graph) {
@@ -54,6 +54,7 @@ public class Main {
         // Non-random BFS
         ArrayList<Arc> randomArcTree =
                 BreadthFirstSearch.generateTree(graph, 0);
+
         randomTree = new ArrayList<>();
         for (Arc a : randomArcTree) randomTree.add(a.support);
         return randomTree;