reorganized the catch-all others and misc packages into thematic pack…

src/main/java/com/thealgorithms/others/MiniMaxAlgorithm.java → src/main/java/com/thealgorithms/backtracking/MiniMaxAlgorithm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.backtracking;
 
 import java.util.Arrays;
 import java.util.Random;

src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java → src/main/java/com/thealgorithms/bitmanipulation/BrianKernighanAlgorithm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.bitmanipulation;
 
 import java.util.Scanner;
 

src/main/java/com/thealgorithms/others/CRC16.java → src/main/java/com/thealgorithms/checksums/CRC16.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 /**
  * Generates a crc16 checksum for a given string

src/main/java/com/thealgorithms/others/CRC32.java → src/main/java/com/thealgorithms/checksums/CRC32.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import java.util.BitSet;
 

src/main/java/com/thealgorithms/others/CRCAlgorithm.java → src/main/java/com/thealgorithms/checksums/CRCAlgorithm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import java.util.ArrayList;
 import java.util.Random;

src/main/java/com/thealgorithms/others/Damm.java → src/main/java/com/thealgorithms/checksums/Damm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import java.util.Objects;
 

src/main/java/com/thealgorithms/others/Luhn.java → src/main/java/com/thealgorithms/checksums/Luhn.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import java.util.Arrays;
 import java.util.Objects;

src/main/java/com/thealgorithms/others/Verhoeff.java → src/main/java/com/thealgorithms/checksums/Verhoeff.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import java.util.Objects;
 

src/main/java/com/thealgorithms/others/Huffman.java → src/main/java/com/thealgorithms/compression/Huffman.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.compression;
 
 import java.util.Comparator;
 import java.util.HashMap;

src/main/java/com/thealgorithms/misc/MapReduce.java → src/main/java/com/thealgorithms/datastructures/MapReduce.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures;
 
 import java.util.Arrays;
 import java.util.LinkedHashMap;

src/main/java/com/thealgorithms/others/ArrayLeftRotation.java → src/main/java/com/thealgorithms/datastructures/arrays/ArrayLeftRotation.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 /**
  * Provides a method to perform a left rotation on an array.

src/main/java/com/thealgorithms/others/ArrayRightRotation.java → src/main/java/com/thealgorithms/datastructures/arrays/ArrayRightRotation.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 /**
  * Provides a method to perform a right rotation on an array.

src/main/java/com/thealgorithms/others/BFPRT.java → src/main/java/com/thealgorithms/datastructures/arrays/BFPRT.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 /**
  * The BFPRT (Median of Medians) algorithm implementation.

src/main/java/com/thealgorithms/others/BoyerMoore.java → src/main/java/com/thealgorithms/datastructures/arrays/BoyerMoore.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 import java.util.Optional;
 
 /**

src/main/java/com/thealgorithms/others/InsertDeleteInArray.java → src/main/java/com/thealgorithms/datastructures/arrays/InsertDeleteInArray.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.Arrays;
 import java.util.Scanner;

src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java → src/main/java/com/thealgorithms/datastructures/arrays/MaximumSumOfDistinctSubarraysWithLengthK.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/com/thealgorithms/others/MosAlgorithm.java → src/main/java/com/thealgorithms/datastructures/arrays/MosAlgorithm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.Arrays;
 import java.util.Comparator;

src/main/java/com/thealgorithms/misc/RangeInSortedArray.java → src/main/java/com/thealgorithms/datastructures/arrays/RangeInSortedArray.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.arrays;
 
 /**
  * Utility class for operations to find the range of occurrences of a key

src/main/java/com/thealgorithms/misc/ShuffleArray.java → src/main/java/com/thealgorithms/datastructures/arrays/ShuffleArray.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.Random;
 

src/main/java/com/thealgorithms/misc/ThreeSumProblem.java → src/main/java/com/thealgorithms/datastructures/arrays/ThreeSumProblem.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/thealgorithms/others/TwoPointers.java → src/main/java/com/thealgorithms/datastructures/arrays/TwoPointers.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.arrays;
 
 /**
  * The two-pointer technique is a useful tool to utilize when searching for

src/main/java/com/thealgorithms/misc/TwoSumProblem.java → src/main/java/com/thealgorithms/datastructures/arrays/TwoSumProblem.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.arrays;
 
 import java.util.HashMap;
 import java.util.Optional;

src/main/java/com/thealgorithms/others/Dijkstra.java → src/main/java/com/thealgorithms/datastructures/graphs/Dijkstra.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.graphs;
 
 import java.util.HashMap;
 import java.util.Map;
@@ -23,19 +23,19 @@ public final class Dijkstra {
     private Dijkstra() {
     }
 
-    private static final Graph.Edge[] GRAPH = {
+    private static final DijkstraGraph.Edge[] GRAPH = {
         // Distance from node "a" to node "b" is 7.
         // In the current Graph there is no way to move the other way (e,g, from "b" to "a"),
         // a new edge would be needed for that
-        new Graph.Edge("a", "b", 7),
-        new Graph.Edge("a", "c", 9),
-        new Graph.Edge("a", "f", 14),
-        new Graph.Edge("b", "c", 10),
-        new Graph.Edge("b", "d", 15),
-        new Graph.Edge("c", "d", 11),
-        new Graph.Edge("c", "f", 2),
-        new Graph.Edge("d", "e", 6),
-        new Graph.Edge("e", "f", 9),
+        new DijkstraGraph.Edge("a", "b", 7),
+        new DijkstraGraph.Edge("a", "c", 9),
+        new DijkstraGraph.Edge("a", "f", 14),
+        new DijkstraGraph.Edge("b", "c", 10),
+        new DijkstraGraph.Edge("b", "d", 15),
+        new DijkstraGraph.Edge("c", "d", 11),
+        new DijkstraGraph.Edge("c", "f", 2),
+        new DijkstraGraph.Edge("d", "e", 6),
+        new DijkstraGraph.Edge("e", "f", 9),
     };
     private static final String START = "a";
     private static final String END = "e";
@@ -44,14 +44,18 @@ private Dijkstra() {
      * main function Will run the code with "GRAPH" that was defined above.
      */
     public static void main(String[] args) {
-        Graph g = new Graph(GRAPH);
+        DijkstraGraph g = new DijkstraGraph(GRAPH);
         g.dijkstra(START);
         g.printPath(END);
         // g.printAllPaths();
     }
 }
 
-class Graph {
+/**
+ * renamed from Graph to DijkstraGraph to prevent name conflict
+ * with Graph in {@link ConnectedComponent}
+ * */
+class DijkstraGraph {
 
     // mapping of vertex names to Vertex objects, built from a set of Edges
 
@@ -152,7 +156,7 @@ public String toString() {
     /**
      * Builds a graph from a set of edges
      */
-    Graph(Edge[] edges) {
+    DijkstraGraph(Edge[] edges) {
         graph = new HashMap<>(edges.length);
 
         // one pass to find all vertices
@@ -167,9 +171,15 @@ public String toString() {
 
         // another pass to set neighbouring vertices
         for (Edge e : edges) {
-            graph.get(e.v1).neighbours.put(graph.get(e.v2), e.dist);
-            // graph.get(e.v2).neighbours.put(graph.get(e.v1), e.dist); // also do this for an
-            // undirected graph
+            var v1 = graph.get(e.v1);
+            var v2 = graph.get(e.v2);
+
+            // this null-check satisfies Infer static analyzer
+            if (v1 != null && v2 != null) {
+                v1.neighbours.put(v2, e.dist);
+                // v2.neighbours.put(v1, e.dist); // also do this for an
+                // undirected graph
+            }
         }
     }
 

src/main/java/com/thealgorithms/others/PageRank.java → src/main/java/com/thealgorithms/datastructures/graphs/PageRank.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.graphs;
 
 import java.util.Scanner;
 

src/main/java/com/thealgorithms/misc/MedianOfRunningArray.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArray.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 import java.util.Collections;
 import java.util.PriorityQueue;

src/main/java/com/thealgorithms/misc/MedianOfRunningArrayByte.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArrayByte.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 public final class MedianOfRunningArrayByte extends MedianOfRunningArray<Byte> {
     @Override

src/main/java/com/thealgorithms/misc/MedianOfRunningArrayDouble.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArrayDouble.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 public final class MedianOfRunningArrayDouble extends MedianOfRunningArray<Double> {
     @Override

src/main/java/com/thealgorithms/misc/MedianOfRunningArrayFloat.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArrayFloat.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 public final class MedianOfRunningArrayFloat extends MedianOfRunningArray<Float> {
     @Override

src/main/java/com/thealgorithms/misc/MedianOfRunningArrayInteger.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArrayInteger.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 public final class MedianOfRunningArrayInteger extends MedianOfRunningArray<Integer> {
     @Override

src/main/java/com/thealgorithms/misc/MedianOfRunningArrayLong.java → src/main/java/com/thealgorithms/datastructures/queues/MedianOfRunningArrayLong.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.datastructures.queues;
 
 public final class MedianOfRunningArrayLong extends MedianOfRunningArray<Long> {
     @Override

src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java → src/main/java/com/thealgorithms/datastructures/queues/QueueUsingTwoStacks.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.datastructures.queues;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/others/LinearCongruentialGenerator.java → src/main/java/com/thealgorithms/devutils/generators/LinearCongruentialGenerator.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.devutils.generators;
 
 /**
  * *

src/main/java/com/thealgorithms/others/PasswordGen.java → src/main/java/com/thealgorithms/devutils/generators/PasswordGen.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.devutils.generators;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/thealgorithms/others/SkylineProblem.java → src/main/java/com/thealgorithms/divideandconquer/SkylineProblem.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.divideandconquer;
 
 import java.util.ArrayList;
 

src/main/java/com/thealgorithms/others/KochSnowflake.java → src/main/java/com/thealgorithms/geometry/KochSnowflake.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.geometry;
 
 import java.awt.BasicStroke;
 import java.awt.Color;

src/main/java/com/thealgorithms/others/LineSweep.java → src/main/java/com/thealgorithms/geometry/LineSweep.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.geometry;
 
 import java.util.Arrays;
 import java.util.Comparator;

src/main/java/com/thealgorithms/others/PerlinNoise.java → src/main/java/com/thealgorithms/geometry/PerlinNoise.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.geometry;
 
 import java.util.Random;
 import java.util.Scanner;

src/main/java/com/thealgorithms/others/IterativeFloodFill.java → src/main/java/com/thealgorithms/graph/IterativeFloodFill.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.graph;
 
 import java.util.LinkedList;
 import java.util.Queue;

src/main/java/com/thealgorithms/misc/ColorContrastRatio.java → src/main/java/com/thealgorithms/maths/ColorContrastRatio.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.maths;
 
 import java.awt.Color;
 

src/main/java/com/thealgorithms/others/Conway.java → src/main/java/com/thealgorithms/maths/Conway.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/thealgorithms/others/FloydTriangle.java → src/main/java/com/thealgorithms/maths/FloydTriangle.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/thealgorithms/others/GaussLegendre.java → src/main/java/com/thealgorithms/maths/GaussLegendre.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 /**
  * Gauss Legendre Algorithm ref

src/main/java/com/thealgorithms/others/Mandelbrot.java → src/main/java/com/thealgorithms/maths/Mandelbrot.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import java.awt.Color;
 import java.awt.image.BufferedImage;

src/main/java/com/thealgorithms/misc/Sparsity.java → src/main/java/com/thealgorithms/matrix/Sparsity.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 /**
  * Utility class for calculating the sparsity of a matrix.

src/main/java/com/thealgorithms/others/BankersAlgorithm.java → src/main/java/com/thealgorithms/memorymanagement/BankersAlgorithm.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.memorymanagement;
 
 import java.util.Scanner;
 

src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java → src/main/java/com/thealgorithms/memorymanagement/MemoryManagementAlgorithms.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.memorymanagement;
 
 import java.util.ArrayList;
 /**

src/test/java/com/thealgorithms/others/MiniMaxAlgorithmTest.java → src/test/java/com/thealgorithms/backtracking/MiniMaxAlgorithmTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.backtracking;
 
 import java.io.ByteArrayOutputStream;
 import java.io.PrintStream;

src/test/java/com/thealgorithms/others/CRC16Test.java → src/test/java/com/thealgorithms/checksums/CRC16Test.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 

src/test/java/com/thealgorithms/others/CRCAlgorithmTest.java → src/test/java/com/thealgorithms/checksums/CRCAlgorithmTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.checksums;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertTrue;