Merge branch 'master' into enable_NeedBraces

Author: samuelfac

checkstyle.xml

@@ -140,7 +140,7 @@
     <!-- TODO <module name="NoWhitespaceAfter"/> -->
     <module name="NoWhitespaceBefore"/>
     <module name="OperatorWrap"/>
-    <!-- TODO <module name="ParenPad"/> -->
+    <module name="ParenPad"/>
     <module name="TypecastParenPad"/>
     <module name="WhitespaceAfter"/>
     <!-- TODO <module name="WhitespaceAround"/> -->

spotbugs-exclude.xml

@@ -222,9 +222,6 @@
     <Match>
         <Bug pattern="IMC_IMMATURE_CLASS_BAD_SERIALVERSIONUID" />
     </Match>
-    <Match>
-        <Bug pattern="SUI_CONTAINS_BEFORE_ADD" />
-    </Match>
     <Match>
         <Bug pattern="DRE_DECLARED_RUNTIME_EXCEPTION" />
     </Match>

src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java

@@ -57,9 +57,11 @@ public static void main(String[] args) {
         obj.go();
     }
 
-    public void go() { // shows distance to all vertices // Interactive run for understanding the
-        try ( // class first time. Assumes source vertex is 0 and
-            Scanner sc = new Scanner(System.in)) {
+    public void go() {
+        // shows distance to all vertices
+        // Interactive run for understanding the
+        // class first time. Assumes source vertex is 0 and
+        try (Scanner sc = new Scanner(System.in)) {
             int i;
             int v;
             int e;

src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java

@@ -81,8 +81,7 @@ public int countGraphs() {
         Set<Node> markedNodes = new HashSet<Node>();
 
         for (Node n : nodeList) {
-            if (!markedNodes.contains(n)) {
-                markedNodes.add(n);
+            if (markedNodes.add(n)) {
                 markedNodes.addAll(depthFirstSearch(n, new ArrayList<Node>()));
                 count++;
             }