Merge branch 'master' into add-library-sort

Author: Rosander0

.github/workflows/build.yml

@@ -8,7 +8,7 @@ jobs:
   build:
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v6
+      - uses: actions/checkout@v7
       - name: Set up JDK
         uses: actions/setup-java@v5
         with:

.github/workflows/clang-format-lint.yml

@@ -11,7 +11,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-    - uses: actions/checkout@v6
+    - uses: actions/checkout@v7
     - uses: DoozyX/clang-format-lint-action@v0.20
       with:
         source: './src'

.github/workflows/codeql.yml

@@ -21,7 +21,7 @@ jobs:
 
     steps:
       - name: Checkout repository
-        uses: actions/checkout@v6
+        uses: actions/checkout@v7
 
       - name: Set up JDK
         uses: actions/setup-java@v5
@@ -52,7 +52,7 @@ jobs:
 
     steps:
       - name: Checkout repository
-        uses: actions/checkout@v6
+        uses: actions/checkout@v7
 
       - name: Initialize CodeQL
         uses: github/codeql-action/init@v4

.github/workflows/infer.yml

@@ -15,7 +15,7 @@ jobs:
   run_infer:
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v6
+      - uses: actions/checkout@v7
 
       - name: Set up JDK
         uses: actions/setup-java@v5

.github/workflows/project_structure.yml

@@ -15,7 +15,7 @@ jobs:
   check_structure:
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v6
+      - uses: actions/checkout@v7
       - uses: actions/setup-python@v6
         with:
           python-version: '3.13'

.github/workflows/update-directorymd.yml

@@ -1,4 +1,4 @@
-name: Generate Directory Markdown
+name: Generate Directory Markdown
 
 on:
   push:
@@ -14,7 +14,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout Repository
-        uses: actions/checkout@v6
+        uses: actions/checkout@v7
         with:
           persist-credentials: false
 

src/main/java/com/thealgorithms/bitmanipulation/BinaryPalindromeCheck.java

@@ -9,6 +9,12 @@
  * </p>
  *
  * @author Hardvan
+ * @see com.thealgorithms.strings.Palindrome
+ * @see com.thealgorithms.stacks.PalindromeWithStack
+ * @see com.thealgorithms.maths.LowestBasePalindrome
+ * @see com.thealgorithms.datastructures.lists.PalindromeSinglyLinkedList
+ * @see com.thealgorithms.maths.PalindromePrime
+ * @see com.thealgorithms.maths.PalindromeNumber
  */
 public final class BinaryPalindromeCheck {
     private BinaryPalindromeCheck() {

src/main/java/com/thealgorithms/conversions/Base64.java

@@ -119,8 +119,15 @@ public static byte[] decode(String input) {
 
         // Validate padding: '=' can only appear at the end (last 1 or 2 chars)
         int firstPadding = input.indexOf('=');
-        if (firstPadding != -1 && firstPadding < input.length() - 2) {
-            throw new IllegalArgumentException("Padding '=' can only appear at the end (last 1 or 2 characters)");
+        if (firstPadding != -1) {
+            if (firstPadding < input.length() - 2) {
+                throw new IllegalArgumentException("Padding '=' can only appear at the end (last 1 or 2 characters)");
+            }
+            for (int i = firstPadding; i < input.length(); i++) {
+                if (input.charAt(i) != '=') {
+                    throw new IllegalArgumentException("A padding '=' must not be followed by a non-padding character");
+                }
+            }
         }
 
         List<Byte> result = new ArrayList<>();

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

@@ -1,6 +1,7 @@
 package com.thealgorithms.datastructures.graphs;
 
 import java.util.Arrays;
+import java.util.PriorityQueue;
 
 /**
  * Dijkstra's algorithm for finding the shortest path from a single source vertex to all other vertices in a graph.
@@ -18,6 +19,21 @@ public DijkstraAlgorithm(int vertexCount) {
         this.vertexCount = vertexCount;
     }
 
+    private static class Node implements Comparable<Node> {
+        int id;
+        int distance;
+
+        Node(int id, int distance) {
+            this.id = id;
+            this.distance = distance;
+        }
+
+        @Override
+        public int compareTo(Node other) {
+            return Integer.compare(this.distance, other.distance);
+        }
+    }
+
     /**
      * Executes Dijkstra's algorithm on the provided graph to find the shortest paths from the source vertex to all other vertices.
      *
@@ -36,18 +52,25 @@ public int[] run(int[][] graph, int source) {
 
         int[] distances = new int[vertexCount];
         boolean[] processed = new boolean[vertexCount];
+        PriorityQueue<Node> unprocessed = new PriorityQueue<>();
 
         Arrays.fill(distances, Integer.MAX_VALUE);
-        Arrays.fill(processed, false);
         distances[source] = 0;
+        unprocessed.add(new Node(source, 0));
+
+        while (!unprocessed.isEmpty()) {
+            Node current = unprocessed.poll();
+            int u = current.id;
 
-        for (int count = 0; count < vertexCount - 1; count++) {
-            int u = getMinDistanceVertex(distances, processed);
+            if (processed[u]) {
+                continue;
+            }
             processed[u] = true;
 
             for (int v = 0; v < vertexCount; v++) {
                 if (!processed[v] && graph[u][v] != 0 && distances[u] != Integer.MAX_VALUE && distances[u] + graph[u][v] < distances[v]) {
                     distances[v] = distances[u] + graph[u][v];
+                    unprocessed.add(new Node(v, distances[v]));
                 }
             }
         }
@@ -56,27 +79,6 @@ public int[] run(int[][] graph, int source) {
         return distances;
     }
 
-    /**
-     * Finds the vertex with the minimum distance value from the set of vertices that have not yet been processed.
-     *
-     * @param distances The array of current shortest distances from the source vertex.
-     * @param processed The array indicating whether each vertex has been processed.
-     * @return The index of the vertex with the minimum distance value.
-     */
-    private int getMinDistanceVertex(int[] distances, boolean[] processed) {
-        int min = Integer.MAX_VALUE;
-        int minIndex = -1;
-
-        for (int v = 0; v < vertexCount; v++) {
-            if (!processed[v] && distances[v] <= min) {
-                min = distances[v];
-                minIndex = v;
-            }
-        }
-
-        return minIndex;
-    }
-
     /**
      * Prints the shortest distances from the source vertex to all other vertices.
      *