diff options
| author | bculkin2442 <bjculkin@mix.wvu.edu> | 2016-04-22 14:29:05 -0400 |
|---|---|---|
| committer | bculkin2442 <bjculkin@mix.wvu.edu> | 2016-04-22 14:29:05 -0400 |
| commit | b65b705c391bb772bc41269bce5243c1cc88969d (patch) | |
| tree | 504ab01aa5faff923a3b278843c41059a4ca2a95 /BJC-Utils2/src/main/java/bjc/utils/graph | |
| parent | e5c81a00b31a12933cf06aaeb94877dceb3ef8dd (diff) | |
Formatting changes
Diffstat (limited to 'BJC-Utils2/src/main/java/bjc/utils/graph')
| -rw-r--r-- | BJC-Utils2/src/main/java/bjc/utils/graph/AdjacencyMap.java | 4 | ||||
| -rw-r--r-- | BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java | 8 |
2 files changed, 6 insertions, 6 deletions
diff --git a/BJC-Utils2/src/main/java/bjc/utils/graph/AdjacencyMap.java b/BJC-Utils2/src/main/java/bjc/utils/graph/AdjacencyMap.java index 8386474..32d3b34 100644 --- a/BJC-Utils2/src/main/java/bjc/utils/graph/AdjacencyMap.java +++ b/BJC-Utils2/src/main/java/bjc/utils/graph/AdjacencyMap.java @@ -5,6 +5,7 @@ import java.io.OutputStream; import java.io.PrintStream; import java.util.InputMismatchException; import java.util.Scanner; + import bjc.utils.data.IHolder; import bjc.utils.data.Identity; import bjc.utils.funcdata.FunctionalList; @@ -118,8 +119,7 @@ public class AdjacencyMap<T> { /** * The backing storage of the map */ - private IFunctionalMap<T, IFunctionalMap<T, Integer>> adjacencyMap = - new FunctionalMap<>(); + private IFunctionalMap<T, IFunctionalMap<T, Integer>> adjacencyMap = new FunctionalMap<>(); /** * Create a new map from a set of vertices 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) -> { |