always use brace in for- and if-construct

1 files changed, 11 insertions, 5 deletions

diff --git a/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java b/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
index 88e54d6..f90172e 100644
--- a/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
+++ b/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
@@ -20,23 +20,27 @@ public class AdjListGraph extends AbstractGraph {
 	/// foo
 	public void insertEdge(final Vertex v1, final Vertex v2, final int w) {
 		Edge e = new Edge(v1, v2, w);
-		if (!outEdge.containsKey(e.from()))
+		if (!outEdge.containsKey(e.from())) {
 			outEdge.put(e.from(), new HashSet<Edge>());
+		}
 		outEdge.get(e.from()).add(e);
 	}
 
 	/// foo
 	public Collection<Edge> edges() {
 		Set<Edge> edges = new HashSet<>();
-		for (Vertex v: outEdge.keySet())edges.addAll(outEdge.get(v));
+		for (Vertex v: outEdge.keySet()) {
+			edges.addAll(outEdge.get(v));
+		}
 
 		return edges;
 	}
 
 	/// foo
 	public Collection<Edge> outEdge(final Vertex v) {
-		if (!outEdge.containsKey(v))
+		if (!outEdge.containsKey(v)) {
 			return new HashSet<Edge>();
+		}
 
 		return outEdge.get(v);
 	}
@@ -45,11 +49,13 @@ public class AdjListGraph extends AbstractGraph {
 	public Integer getWeight(final Vertex v1, final Vertex v2) {
 
 		// linear in number of outedges from vertices
-		if (!outEdge.containsKey(v1))
+		if (!outEdge.containsKey(v1)) {
 			return null;
+		}
 		for (Edge e: outEdge.get(v1)) {
-			if (e.to() == v2)
+			if (e.to() == v2) {
 				return e.weight();
+			}
 		}
 
 		return null;