Fixed check-style nags.
diff --git a/utils/misc/src/main/java/org/onlab/graph/BreadthFirstSearch.java b/utils/misc/src/main/java/org/onlab/graph/BreadthFirstSearch.java
index 66dd33a..2346ff6 100644
--- a/utils/misc/src/main/java/org/onlab/graph/BreadthFirstSearch.java
+++ b/utils/misc/src/main/java/org/onlab/graph/BreadthFirstSearch.java
@@ -12,7 +12,7 @@
@Override
public Result<V, E> search(Graph<V, E> graph, V src, V dst, EdgeWeight<V, E> ew) {
checkArguments(graph, src, dst);
-
+
// Prepare the graph result.
DefaultResult result = new DefaultResult(src, dst);
@@ -20,15 +20,16 @@
Set<V> frontier = new HashSet<>();
result.costs.put(src, 0.0);
frontier.add(src);
-
- search: while (!frontier.isEmpty()) {
+
+ search:
+ while (!frontier.isEmpty()) {
// Prepare the next frontier.
Set<V> next = new HashSet<>();
// Visit all vertexes in the current frontier.
for (V vertex : frontier) {
double cost = result.cost(vertex);
-
+
// Visit all egress edges of the current frontier vertex.
for (E edge : graph.getEdgesFrom(vertex)) {
V nextVertex = edge.dst();
@@ -38,20 +39,21 @@
cost + (ew == null ? 1.0 : ew.weight(edge)),
true);
// If we have reached our intended destination, bail.
- if (nextVertex.equals(dst))
+ if (nextVertex.equals(dst)) {
break search;
+ }
next.add(nextVertex);
}
}
}
-
+
// Promote the next frontier.
frontier = next;
}
-
+
// Finally, but the paths on the search result and return.
result.buildPaths();
return result;
}
-
+
}