Fixes(#3359)

Author: siddhant2002

src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java

@@ -33,8 +33,6 @@ public AllPathsFromSourceToTarget(int vertices)
     }
 
     // utility method to initialise adjacency list
-    
-    @SuppressWarnings("unchecked")
     private void initAdjList()
     {
         adjList = new ArrayList[v];
@@ -102,7 +100,7 @@ private int printAllPathsUtil(Integer u, Integer d, boolean[] isVisited, List<In
     }
 
     // Driver program
-    public static boolean all_Paths_From_Source_To_Target(int vertices, int a[][], int source, int destination, int num_of_paths)
+    public static int[][] allPathsFromSourceToTarget(int vertices, int a[][], int source, int destination, int num_of_paths)
     {
         // Create a sample graph
         AllPathsFromSourceToTarget g = new AllPathsFromSourceToTarget(vertices);

src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java

@@ -14,7 +14,7 @@ void testForFirstCase() {
         int source = 2;
         int destination = 3;
         int num_of_paths = 3;
-        assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.allPathsFromSourceToTarget(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(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.allPathsFromSourceToTarget(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(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.allPathsFromSourceToTarget(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(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
+        assertTrue(AllPathsFromSourceToTarget.allPathsFromSourceToTarget(vertices,a,source,destination,num_of_paths));
     }
 }