Updated according to checks

Author: Anshul-9923

src/main/java/com/thealgorithms/graph/DijkstraAlgorithm.java

@@ -8,8 +8,8 @@
  * Finds the shortest paths from a source node to all other nodes in a graph using Dijkstra's algorithm.
  *
  * @param adjList The adjacency list representation of the graph where each edge has a weight.
- * @param n The number of nodes in the graph.
- * @param source The starting node for finding the shortest path.
+ * @param n       The number of nodes in the graph.
+ * @param source  The starting node for finding the shortest path.
  * @return An array where the value at each index represents the shortest distance from the source to that node.
  */
 public class DijkstraAlgorithm {
@@ -66,4 +66,4 @@ public static void main(String[] args) {
             System.out.println("To node " + i + ": " + distances[i]);
         }
     }
-}
+}