Fix

Author: Hardvan

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

@@ -120,9 +120,7 @@ static void initializeGraph(Graph graph, ArrayList<Integer> data) {
      */
     public static PathAndDistance aStar(int from, int to, Graph graph, int[] heuristic) {
         // PriorityQueue to explore nodes based on their distance and estimated cost to reach the destination
-        PriorityQueue<PathAndDistance> queue = new PriorityQueue<>(
-                Comparator.comparingInt(a -> (a.getDistance() + a.getEstimated()))
-        );
+        PriorityQueue<PathAndDistance> queue = new PriorityQueue<>(Comparator.comparingInt(a -> (a.getDistance() + a.getEstimated())));
 
         // Start with the initial node
         queue.add(new PathAndDistance(0, new ArrayList<>(List.of(from)), heuristic[from]));

src/test/java/com/thealgorithms/datastructures/graphs/AStarTest.java

@@ -4,9 +4,9 @@
 import static org.junit.jupiter.api.Assertions.assertNull;
 
 import java.util.ArrayList;
+import java.util.Arrays;
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
-import java.util.Arrays;
 
 public class AStarTest {
 
@@ -17,13 +17,7 @@ public class AStarTest {
     public void setUp() {
         // Initialize graph and heuristic values for testing
         graph = new AStar.Graph(5);
-        ArrayList<Integer> graphData = new ArrayList<>(Arrays.asList(
-                0, 1, 1, null,
-                0, 2, 2, null,
-                1, 3, 1, null,
-                2, 3, 1, null,
-                3, 4, 1, null
-        ));
+        ArrayList<Integer> graphData = new ArrayList<>(Arrays.asList(0, 1, 1, null, 0, 2, 2, null, 1, 3, 1, null, 2, 3, 1, null, 3, 4, 1, null));
         AStar.initializeGraph(graph, graphData);
 
         heuristic = new int[] {5, 4, 3, 2, 0}; // Heuristic values for each node