From aec8cf2f921b8311e89f456ce4fadf9aa7003610 Mon Sep 17 00:00:00 2001
From: Gianluca <gianlucamastrolonardo10@gmail.com>
Date: Thu, 21 Mar 2024 16:29:06 +0100
Subject: [PATCH] Ricerca cammino migliore rotto
---
.../Lab2/out/production/Lab2/BFS.class | Bin 4427 -> 4427 bytes
.../Lab2/out/production/Lab2/Main.class | Bin 2217 -> 2217 bytes
Algoritmi_2/Laboratorio/Lab2/src/BFS.java | 2 ++
Algoritmi_2/Laboratorio/Lab2/src/Main.java | 2 +-
4 files changed, 3 insertions(+), 1 deletion(-)
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
GIT binary patch
delta 41
xcmX@DbXsY{CIQ(M3~UT58H5>DF~~5iVNhgP%b>%sj=_XsJ%cU7rpf08Y5@Ci3$6eF
delta 41
xcmX@DbXsY{CIQ)%3~UUm7=#&CGsrNkWl&^T$DqTop237+1A{HYmdWP@Y5@EV3%39O
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
GIT binary patch
delta 14
VcmZ1}xKeOKDmx?d<}`L^MgSv01Ni^|
delta 14
VcmZ1}xKeOKDmx?l<}`L^MgSvO1N{I1
diff --git a/Algoritmi_2/Laboratorio/Lab2/src/BFS.java b/Algoritmi_2/Laboratorio/Lab2/src/BFS.java
index 654bb18..0255e88 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 5b5203f..35b29dc 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);
--
GitLab