chore: suppress rawtypes in selected classes (#6261)

Author: vil02

pom.xml

@@ -76,7 +76,6 @@
                     <compilerArgs>
                         <arg>-Xlint:all</arg>
                         <arg>-Xlint:-auxiliaryclass</arg>
-                        <arg>-Xlint:-rawtypes</arg>
                         <arg>-Xlint:-unchecked</arg>
                         <arg>-Werror</arg>
                     </compilerArgs>

src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java

@@ -9,6 +9,7 @@
  *
  * @author <a href="https://github.com/siddhant2002">Siddhant Swarup Mallick</a>
  */
+@SuppressWarnings("rawtypes")
 public class AllPathsFromSourceToTarget {
 
     // No. of vertices in graph

src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java

@@ -12,6 +12,7 @@
  *
  * @param <T> The type of elements to be stored in the Bloom filter.
  */
+@SuppressWarnings("rawtypes")
 public class BloomFilter<T> {
 
     private final int numberOfHashFunctions;

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

@@ -19,6 +19,7 @@
  *
  * <p><strong>Time Complexity:</strong> O(E log V), where E is the number of edges and V is the number of vertices.</p>
  */
+@SuppressWarnings("rawtypes")
 public class Kruskal {
 
     /**

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

@@ -22,6 +22,7 @@
  * For more information, see <a href="https://en.wikipedia.org/wiki/Graph_coloring">Graph Coloring</a>.
  * </p>
  */
+@SuppressWarnings("rawtypes")
 public final class WelshPowell {
     private static final int BLANK_COLOR = -1; // Constant representing an uncolored state
 

src/main/java/com/thealgorithms/datastructures/hashmap/hashing/GenericHashMapUsingArray.java

@@ -23,6 +23,7 @@
  * @param <K> the type of keys maintained by this hash map
  * @param <V> the type of mapped values
  */
+@SuppressWarnings("rawtypes")
 public class GenericHashMapUsingArray<K, V> {
 
     private int size; // Total number of key-value pairs

src/main/java/com/thealgorithms/datastructures/hashmap/hashing/HashMap.java

@@ -8,6 +8,7 @@
  * @param <K> the type of keys maintained by this map
  * @param <V> the type of mapped values
  */
+@SuppressWarnings("rawtypes")
 public class HashMap<K, V> {
     private final int hashSize;
     private final LinkedList<K, V>[] buckets;

src/main/java/com/thealgorithms/datastructures/hashmap/hashing/LinearProbingHashMap.java

@@ -34,6 +34,7 @@
  * @param <Key> the type of keys maintained by this map
  * @param <Value> the type of mapped values
  */
+@SuppressWarnings("rawtypes")
 public class LinearProbingHashMap<Key extends Comparable<Key>, Value> extends Map<Key, Value> {
     private int hsize; // size of the hash table
     private Key[] keys; // array to store keys

src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java

@@ -10,6 +10,7 @@
  *
  * @param <E> the type of elements held in this list
  */
+@SuppressWarnings("rawtypes")
 public class CircleLinkedList<E> {
 
     /**

src/main/java/com/thealgorithms/datastructures/lists/CursorLinkedList.java

@@ -10,6 +10,7 @@
  *
  * @param <T> the type of elements in this list
  */
+@SuppressWarnings("rawtypes")
 public class CursorLinkedList<T> {
 
     /**