Fixes(#3359)

Author: siddhant2002

src/main/java/com/thealgorithms/backtracking/All_Paths_From_Source_To_Target.java renamed to src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java

@@ -13,7 +13,7 @@
 // A directed graph using adjacency list representation
 
 
-public class All_Paths_From_Source_To_Target {
+public class AllPathsFromSourceToTarget {
 
     // No. of vertices in graph
     private int v;
@@ -105,7 +105,7 @@ private int printAllPathsUtil(Integer u, Integer d, boolean[] isVisited, List<In
     public static boolean all_Paths_From_Source_To_Target(int vertices, int a[][], int source, int destination, int num_of_paths)
     {
         // Create a sample graph
-        All_Paths_From_Source_To_Target g = new All_Paths_From_Source_To_Target(vertices);
+        AllPathsFromSourceToTarget g = new AllPathsFromSourceToTarget(vertices);
         for(int i=0 ; i<a.length ; i++)
         {
             g.addEdge(a[i][0], a[i][1]);

src/test/java/com/thealgorithms/backtracking/All_Paths_From_Source_To_Target_Test.java renamed to src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java

@@ -2,10 +2,10 @@
 
 import static org.junit.jupiter.api.Assertions.*;
 
-import com.thealgorithms.backtracking.All_Paths_From_Source_To_Target;
+import com.thealgorithms.backtracking.AllPathsFromSourceToTarget;
 import org.junit.jupiter.api.Test;
 
-public class All_Paths_From_Source_To_Target_Test {
+public class AllPathsFromSourceToTargetTest {
 
     @Test
     void testForFirstCase() {
@@ -14,7 +14,7 @@ void testForFirstCase() {
         int source = 2;
         int destination = 3;
         int num_of_paths = 3;
-        assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
     }
 
     @Test
@@ -24,7 +24,7 @@ void testForSecondCase() {
         int source = 0;
         int destination = 4;
         int num_of_paths = 6;
-        assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
     }
 
     @Test
@@ -34,7 +34,7 @@ void testForThirdCase() {
         int source = 1;
         int destination = 5;
         int num_of_paths = 2;
-        assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
     }
 
     @Test
@@ -44,6 +44,6 @@ void testForFourthcase() {
         int source = 0;
         int destination = 2;
         int num_of_paths = 2;
-        assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
     }
 }