diff --git a/asdl/bin/network/network/Network$BreadthFirstIterator.class b/asdl/bin/network/network/Network$BreadthFirstIterator.class
index b1b4c8b..ec0923a 100644
Binary files a/asdl/bin/network/network/Network$BreadthFirstIterator.class and b/asdl/bin/network/network/Network$BreadthFirstIterator.class differ
diff --git a/asdl/bin/network/network/Network$DepthFirstIterator.class b/asdl/bin/network/network/Network$DepthFirstIterator.class
index 5a20513..f091a57 100644
Binary files a/asdl/bin/network/network/Network$DepthFirstIterator.class and b/asdl/bin/network/network/Network$DepthFirstIterator.class differ
diff --git a/asdl/bin/network/network/Network$NetworkIterator.class b/asdl/bin/network/network/Network$NetworkIterator.class
index 9feb5eb..29b534e 100644
Binary files a/asdl/bin/network/network/Network$NetworkIterator.class and b/asdl/bin/network/network/Network$NetworkIterator.class differ
diff --git a/asdl/bin/network/network/Network.class b/asdl/bin/network/network/Network.class
index 14d8b28..ac6f84c 100644
Binary files a/asdl/bin/network/network/Network.class and b/asdl/bin/network/network/Network.class differ
diff --git a/asdl/src/network/network/Network.java b/asdl/src/network/network/Network.java
index fc84258..1a56e1b 100644
--- a/asdl/src/network/network/Network.java
+++ b/asdl/src/network/network/Network.java
@@ -23,6 +23,36 @@ public class Network<Vertex extends Comparable<? super Vertex>> implements Graph
 	public Network(Network<Vertex> network) {
 		this.adjacencyMap = new TreeMap<Vertex, TreeMap<Vertex, Double>>(network.adjacencyMap);
 	}
+
+	/*
+	TOTALE 2024-02-13
+	Implementare un metodo costruttore public Network(Vertex[] V) della 
+	classe network che prende in input i vertici (distinti) del grafo e 
+	inserisce nel nuovo grafo un arco diretto da un vertice V[i] a un vertice V[j] (i!=j)
+	con probabilità 1/2 assegnando peso -1.0 se V[i]<V[j], 1.0 altrimenti.
+	*/
+	public Network(Vertex[] V) {
+		// Null check
+		if (V == null) throw new NullPointerException();
+		// Aggiunta di tutti i vertici
+		for (Vertex v : V) addVertex(v);
+		// Lettura dei valori
+		for (int i = 0; i < V.length; i++) {
+			// Leggiamo il vertice
+			Vertex iVertex = V[i];
+			for (int j = 0; j < V.length; j++) {
+				// Se la coppia è uguale, allora salta
+				if (i == j) continue;
+				// Leggiamo il vertice j
+				Vertex jVertex = V[j];
+				// Probabilità 1/2
+				if (Math.random() < 0.5) continue;
+				// Aggiunta dell'arco
+				if (iVertex.compareTo(jVertex) < 0) addEdge(iVertex, jVertex, -1.0);
+				else addEdge(iVertex, jVertex, 1.0);
+			}
+		}
+	}
 	
 	@Override
 	public boolean equals(Object object) {
@@ -305,7 +335,5 @@ public class Network<Vertex extends Comparable<? super Vertex>> implements Graph
 		}
 		return true;
 	}
-
-	
 	
 }