Fixes(#3359)

Author: siddhant2002

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

@@ -53,7 +53,7 @@ public void addEdge(int u, int v)
 
     // Prints all paths from 's' to 'd'
 
-    public void printAllPaths(int s, int d, int c)
+    public void printAllPaths(int s, int d)
     {
         boolean[] isVisited = new boolean[v];
         ArrayList<Integer> pathList = new ArrayList<>();
@@ -62,7 +62,7 @@ public void printAllPaths(int s, int d, int c)
         pathList.add(s);
 
         // Call recursive utility
-        printAllPathsUtil(s, d, isVisited, pathList);
+        printAllPathsUtil(s, d, isVisited, pathList,a);
         return a[0];
     }
 
@@ -88,7 +88,7 @@ private int printAllPathsUtil(Integer u, Integer d, boolean[] isVisited, List<In
             if (!isVisited[i]) {
                 // store current node in path[]
                 localPathList.add(i);
-                printAllPathsUtil(i, d, isVisited, localPathList);
+                printAllPathsUtil(i, d, isVisited, localPathList,a);
 
                 // remove current node in path[]
                 localPathList.remove(i);