X-Git-Url: https://gerrit.onap.org/r/gitweb?a=blobdiff_plain;f=datarouter-node%2Fsrc%2Fmain%2Fjava%2Forg%2Fonap%2Fdmaap%2Fdatarouter%2Fnode%2FPathFinder.java;h=fec2ca39bd9422e53b5ac518a75df582a155224b;hb=3a2e2a602b9aa3677d941f3d5d65ea0dce80b7ab;hp=f9173e9b211fa7f1387aed2da597300fbf4784da;hpb=4e61cfafc9b10ca604b8e2c7ec0272246502fa82;p=dmaap%2Fdatarouter.git

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 f9173e9b..fec2ca39 100644
--- 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,14 +24,19 @@
 
 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 {
+
         boolean mark;
         boolean bad;
         NodeConfig.ProvHop basis;
@@ -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>();