always use brace in for- and if-construct

1 files changed, 10 insertions, 5 deletions

diff --git a/src/com.example.portfolio3/com/example/portfolio3/AdjMapGraph.java b/src/com.example.portfolio3/com/example/portfolio3/AdjMapGraph.java
index e85db6c..b538f24 100644
--- a/src/com.example.portfolio3/com/example/portfolio3/AdjMapGraph.java
+++ b/src/com.example.portfolio3/com/example/portfolio3/AdjMapGraph.java
@@ -20,17 +20,20 @@ class AdjMapGraph 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 HashMap<Vertex, Edge>());
+		}
 		outEdge.get(e.from()).put(e.to(), e);
 	}
 
 	/// foo
 	public Collection<Edge> edges() {
 		Set<Edge> edges = new HashSet<>();
-		for (Vertex v : outEdge.keySet())
-			for (Vertex w : outEdge.get(v).keySet())
+		for (Vertex v : outEdge.keySet()) {
+			for (Vertex w : outEdge.get(v).keySet()) {
 				edges.add(outEdge.get(v).get(w));
+			}
+		}
 
 		return edges;
 	}
@@ -43,10 +46,12 @@ class AdjMapGraph extends AbstractGraph {
 	/// foo
 	public Integer getWeight(final Vertex v1, final Vertex v2) {
 		// constant time operation
-		if (!outEdge.containsKey(v1))
+		if (!outEdge.containsKey(v1)) {
 			return null;
-		if (!outEdge.get(v1).containsKey(v2))
+		}
+		if (!outEdge.get(v1).containsKey(v2)) {
 			return null;
+		}
 
 		return outEdge.get(v1).get(v2).weight();
 	}