From 705b7a5a32793f7ed8a24b8b35afe3f9d49348be Mon Sep 17 00:00:00 2001
From: Jonas Smedegaard <dr@jones.dk>
Date: Tue, 29 Apr 2025 07:19:10 +0200
Subject: tidy whitespace

---
 .../com/example/portfolio3/EdgeGraph.java          | 66 ++++++++++++----------
 1 file changed, 37 insertions(+), 29 deletions(-)

(limited to 'src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java')

diff --git a/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java b/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java
index 979b118..8bd9259 100644
--- a/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java
+++ b/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java
@@ -10,33 +10,41 @@ import java.util.Set;
 /// EdgeGraph - One big set of all edges in the graph
 class EdgeGraph extends AbstractGraph {
 
-  /// foo
-  EdgeGraph() {}
-
-  /// foo
-  Set<Edge> edges=new HashSet<>();
-
-  /// foo
-  public void insertEdge(final Vertex v1, final Vertex v2, final int w){
-    edges.add(new Edge(v1,v2,w));
-  }
-
-  /// foo
-  public Collection<Edge> edges(){return edges;}
-
-  /// foo
-  public Collection<Edge> outEdge(final Vertex v){
-    ArrayList<Edge> outEdge=new ArrayList<>();
-    for(Edge e:edges)if(e.from()==v)outEdge.add(e);
-    return outEdge;
-  }
-
-  /// foo
-  public Integer getWeight(final Vertex v1, final Vertex v2){
-    // linear in number of edges in the graph
-    for(Edge e:edges){
-      if(e.from()==v1 && e.to()==v2)return e.weight();
-    }
-    return null;
-  }
+	/// foo
+	EdgeGraph() { }
+
+	/// foo
+	Set<Edge> edges = new HashSet<>();
+
+	/// foo
+	public void insertEdge(final Vertex v1, final Vertex v2, final int w) {
+		edges.add(new Edge(v1, v2, w));
+	}
+
+	/// foo
+	public Collection<Edge> edges() {
+		return edges;
+	}
+
+	/// foo
+	public Collection<Edge> outEdge(final Vertex v) {
+		ArrayList<Edge> outEdge = new ArrayList<>();
+		for (Edge e: edges)
+			if (e.from() == v)
+				outEdge.add(e);
+
+		return outEdge;
+	}
+
+	/// foo
+	public Integer getWeight(final Vertex v1, final Vertex v2) {
+
+		// linear in number of edges in the graph
+		for (Edge e:edges) {
+			if (e.from() == v1 && e.to() == v2)
+				return e.weight();
+		}
+
+		return null;
+	}
 }
-- 
cgit v1.2.3