From b65b705c391bb772bc41269bce5243c1cc88969d Mon Sep 17 00:00:00 2001
From: bculkin2442 <bjculkin@mix.wvu.edu>
Date: Fri, 22 Apr 2016 14:29:05 -0400
Subject: Formatting changes

---
 BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java')

diff --git a/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java b/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java
index d08c3f9..fbaf3f6 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java
@@ -172,8 +172,8 @@ public class Graph<T> {
 					});
 
 			// Get the edge with the minimum distance
-			IHolder<Edge<T>> minimumEdge =
-					new Identity<>(availableEdges.poll());
+			IHolder<Edge<T>> minimumEdge = new Identity<>(
+					availableEdges.poll());
 
 			// Only consider edges where we haven't visited the target of
 			// the edge
@@ -254,8 +254,8 @@ public class Graph<T> {
 	 * @return A adjacency map representing this graph
 	 */
 	public AdjacencyMap<T> toAdjacencyMap() {
-		AdjacencyMap<T> adjacencyMap =
-				new AdjacencyMap<>(backingGraph.keyList());
+		AdjacencyMap<T> adjacencyMap = new AdjacencyMap<>(
+				backingGraph.keyList());
 
 		backingGraph.forEach((key, value) -> {
 			value.forEach((targetKey, targetValue) -> {
-- 
cgit v1.2.3