Skip to content

Commit 5736de7

Browse files
committed
Fixes(#3359)
1 parent d55840a commit 5736de7

File tree

2 files changed

+8
-8
lines changed

2 files changed

+8
-8
lines changed

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@
1313
// A directed graph using adjacency list representation
1414

1515

16-
public class All_Paths_From_Source_To_Target {
16+
public class AllPathsFromSourceToTarget {
1717

1818
// No. of vertices in graph
1919
private int v;
@@ -105,7 +105,7 @@ private int printAllPathsUtil(Integer u, Integer d, boolean[] isVisited, List<In
105105
public static boolean all_Paths_From_Source_To_Target(int vertices, int a[][], int source, int destination, int num_of_paths)
106106
{
107107
// Create a sample graph
108-
All_Paths_From_Source_To_Target g = new All_Paths_From_Source_To_Target(vertices);
108+
AllPathsFromSourceToTarget g = new AllPathsFromSourceToTarget(vertices);
109109
for(int i=0 ; i<a.length ; i++)
110110
{
111111
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

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -2,10 +2,10 @@
22

33
import static org.junit.jupiter.api.Assertions.*;
44

5-
import com.thealgorithms.backtracking.All_Paths_From_Source_To_Target;
5+
import com.thealgorithms.backtracking.AllPathsFromSourceToTarget;
66
import org.junit.jupiter.api.Test;
77

8-
public class All_Paths_From_Source_To_Target_Test {
8+
public class AllPathsFromSourceToTargetTest {
99

1010
@Test
1111
void testForFirstCase() {
@@ -14,7 +14,7 @@ void testForFirstCase() {
1414
int source = 2;
1515
int destination = 3;
1616
int num_of_paths = 3;
17-
assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
17+
assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
1818
}
1919

2020
@Test
@@ -24,7 +24,7 @@ void testForSecondCase() {
2424
int source = 0;
2525
int destination = 4;
2626
int num_of_paths = 6;
27-
assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
27+
assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
2828
}
2929

3030
@Test
@@ -34,7 +34,7 @@ void testForThirdCase() {
3434
int source = 1;
3535
int destination = 5;
3636
int num_of_paths = 2;
37-
assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
37+
assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
3838
}
3939

4040
@Test
@@ -44,6 +44,6 @@ void testForFourthcase() {
4444
int source = 0;
4545
int destination = 2;
4646
int num_of_paths = 2;
47-
assertTrue(All_Paths_From_Source_To_Target.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
47+
assertTrue(AllPathsFromSourceToTarget.all_Paths_From_Source_To_Target (vertices,a,source,destination,num_of_paths));
4848
}
4949
}

0 commit comments

Comments
 (0)