Merge "Fix formatting"

[dmaap/datarouter.git] / datarouter-node / src / main / java / org / onap / dmaap / datarouter / node / PathFinder.java

diff --git a/datarouter-node/src/main/java/org/onap/dmaap/datarouter/node/PathFinder.java b/datarouter-node/src/main/java/org/onap/dmaap/datarouter/node/PathFinder.java
index 98beebc..fec2ca3 100644 (file)
--- a/datarouter-node/src/main/java/org/onap/dmaap/datarouter/node/PathFinder.java
+++ b/datarouter-node/src/main/java/org/onap/dmaap/datarouter/node/PathFinder.java
@@ -24,17 +24,22 @@
 
 package org.onap.dmaap.datarouter.node;
 
-import java.util.*;
+import java.util.HashSet;
+import java.util.Hashtable;
+import java.util.Vector;
 
 /**
- * Given a set of node names and next hops, identify and ignore any cycles and figure out the sequence of next hops to get from this node to any other node
+ * Given a set of node names and next hops, identify and ignore any cycles and figure out the sequence of next hops to
+ * get from this node to any other node
  */
 
 public class PathFinder {
+
     private static class Hop {
-        public boolean mark;
-        public boolean bad;
-        public NodeConfig.ProvHop basis;
+
+        boolean mark;
+        boolean bad;
+        NodeConfig.ProvHop basis;
     }
 
     private Vector<String> errors = new Vector<String>();
@@ -90,8 +95,8 @@ public class PathFinder {
      * Find routes from a specified origin to all of the nodes given a set of specified next hops.
      *
      * @param origin where we start
-     * @param nodes  where we can go
-     * @param hops   detours along the way
+     * @param nodes where we can go
+     * @param hops detours along the way
      */
     public PathFinder(String origin, String[] nodes, NodeConfig.ProvHop[] hops) {
         HashSet<String> known = new HashSet<String>();