diff --git a/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/BFS.class b/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/BFS.class
index bcdfbf7491d08e9ee52200066264a542cc54a953..a47ede68eacd78705e0503a2b3015c3414ddb65a 100644
Binary files a/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/BFS.class and b/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/BFS.class differ
diff --git a/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/Main.class b/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/Main.class
index 9551bf625d56319a76715db63213e767e4921c46..24ffaf85b986d4c2216a608f711754d9e5d0ab46 100644
Binary files a/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/Main.class and b/Algoritmi_2/Laboratorio/Lab2/out/production/Lab2/Main.class differ
diff --git a/Algoritmi_2/Laboratorio/Lab2/src/BFS.java b/Algoritmi_2/Laboratorio/Lab2/src/BFS.java
index 654bb18ee0ad4785bdbbe2e777c2745005853231..0255e885295fece5d92d28ea5946d01a242f36a7 100644
--- a/Algoritmi_2/Laboratorio/Lab2/src/BFS.java
+++ b/Algoritmi_2/Laboratorio/Lab2/src/BFS.java
@@ -165,6 +165,8 @@ public class BFS {
 
         //Proviamo con la ricorsione
 
+        //Implementazione sbagliata, ma l'idea credo sia giusta
+
         GraphInterface bfsAlbero = bfsTree(sorgente);
         boolean[] founded = new boolean[this.myGraph.getOrder()];
         ArrayList<Integer> returnArray = new ArrayList<>();
diff --git a/Algoritmi_2/Laboratorio/Lab2/src/Main.java b/Algoritmi_2/Laboratorio/Lab2/src/Main.java
index 5b5203f650476e22d77912e179034ee96fd5936f..35b29dc09e67d51a5eda9c55b6adf309fe0d627d 100644
--- a/Algoritmi_2/Laboratorio/Lab2/src/Main.java
+++ b/Algoritmi_2/Laboratorio/Lab2/src/Main.java
@@ -7,7 +7,7 @@ public class Main {
     public static void main(String[] args) {
         Graph mioGrafo = new UndirectedGraph("7; 0 4; 4 3; 1 3; 1 2; 0 2; 0 5; 5 2"); //Num Nodi + Archi
         BFS mioBFS = new BFS(mioGrafo);
-        int source = 4;
+        int source = 0;
         int destination = 3;
 
         System.out.println(">>> Sorgente delle Operazione: " + source);