Fix issues to make the project build successfully and rename files

Author: DenizAltunkapan

src/main/java/com/thealgorithms/graph/ConstraintShortestPath.java renamed to src/main/java/com/thealgorithms/graph/ConstrainedShortestPath.java

@@ -12,7 +12,7 @@
  *
  * @author  <a href="https://github.com/DenizAltunkapan">Deniz Altunkapan</a>
  */
-public class ConstraintShortestPath {
+public class ConstrainedShortestPath {
 
     /**
      * Represents a graph using an adjacency list.
@@ -57,7 +57,7 @@ public int getNumNodes() {
             return adjacencyList.size();
         }
 
-        public static record Edge(int from, int to, int cost, int resource) {
+        public record Edge(int from, int to, int cost, int resource) {
         }
     }
 
@@ -70,7 +70,7 @@ public static record Edge(int from, int to, int cost, int resource) {
      * @param graph       the graph representing the problem
      * @param maxResource the maximum allowable resource
      */
-    public ConstraintShortestPath(Graph graph, int maxResource) {
+    public ConstrainedShortestPath(Graph graph, int maxResource) {
         this.graph = graph;
         this.maxResource = maxResource;
     }
@@ -97,7 +97,9 @@ public int solve(int start, int target) {
         // Dynamic Programming: Iterate over resources and nodes
         for (int r = 0; r <= maxResource; r++) {
             for (int u = 0; u < numNodes; u++) {
-                if (dp[r][u] == Integer.MAX_VALUE) continue;
+                if (dp[r][u] == Integer.MAX_VALUE) {
+                    continue;
+                }
                 for (Graph.Edge edge : graph.getEdges(u)) {
                     int v = edge.to();
                     int cost = edge.cost();

src/test/java/com/thealgorithms/graph/ConstraintShortestPathTest.java renamed to src/test/java/com/thealgorithms/graph/ConstrainedShortestPathTest.java

@@ -1,11 +1,11 @@
 package com.thealgorithms.graph;
 
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
-import com.thealgorithms.graph.ConstraintShortestPath.*;
+import com.thealgorithms.graph.ConstrainedShortestPath.Graph;
 import org.junit.jupiter.api.Test;
 
-public class ConstraintShortestPathTest {
+public class ConstrainedShortestPathTest {
 
     /**
      * Tests a simple linear graph to verify if the solver calculates the shortest path correctly.
@@ -18,7 +18,7 @@ public void testSimpleGraph() {
         graph.addEdge(1, 2, 3, 2);
 
         int maxResource = 5;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(5, solver.solve(0, 2));
     }
@@ -34,7 +34,7 @@ public void testNoPath() {
         graph.addEdge(1, 2, 3, 6);
 
         int maxResource = 5;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(-1, solver.solve(0, 2));
     }
@@ -52,7 +52,7 @@ public void testMultiplePaths() {
         graph.addEdge(2, 3, 3, 2);
 
         int maxResource = 3;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(5, solver.solve(0, 3));
     }
@@ -68,7 +68,7 @@ public void testExactResourceLimit() {
         graph.addEdge(1, 2, 3, 2);
 
         int maxResource = 5;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(5, solver.solve(0, 2));
     }
@@ -84,7 +84,7 @@ public void testDisconnectedGraph() {
         graph.addEdge(2, 3, 3, 2);
 
         int maxResource = 5;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(-1, solver.solve(0, 3));
     }
@@ -102,7 +102,7 @@ public void testGraphWithCycles() {
         graph.addEdge(1, 3, 4, 2);
 
         int maxResource = 3;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(6, solver.solve(0, 3));
     }
@@ -120,7 +120,7 @@ public void testLargeGraphPerformance() {
         }
 
         int maxResource = 1000;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(999, solver.solve(0, nodeCount - 1));
     }
@@ -136,7 +136,7 @@ public void testIsolatedNodes() {
         graph.addEdge(1, 2, 3, 1);
 
         int maxResource = 5;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(-1, solver.solve(0, 3));
     }
@@ -154,7 +154,7 @@ public void testCyclicLargeGraph() {
         graph.addEdge(0, 5, 5, 3);
 
         int maxResource = 10;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(5, solver.solve(0, 5));
     }
@@ -180,7 +180,7 @@ public void testLargeComplexGraph() {
         graph.addEdge(8, 9, 2, 1);
 
         int maxResource = 10;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(19, solver.solve(0, 9));
     }
@@ -194,7 +194,7 @@ public void testSingleNodeGraph() {
         Graph graph = new Graph(1);
 
         int maxResource = 0;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(0, solver.solve(0, 0));
     }
@@ -211,7 +211,7 @@ public void testTightResourceConstraint() {
         graph.addEdge(0, 2, 2, 2);
 
         int maxResource = 3;
-        ConstraintShortestPath solver = new ConstraintShortestPath(graph, maxResource);
+        ConstrainedShortestPath solver = new ConstrainedShortestPath(graph, maxResource);
 
         assertEquals(2, solver.solve(0, 2));
     }