algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enhance docs, add more tests in FordFulkerson (#5953)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-23 23:37:04 +05:30
committed by GitHub
parent 4f7957ff14
commit 520e46443e
2 changed files with 140 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

122
src/test/java/com/thealgorithms/datastructures/graphs/FordFulkersonTest.java
View File

@@ -91,4 +91,126 @@ public class FordFulkersonTest {
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 4);
assertEquals(19, maxFlow);
}
@Test
public void testLargeNetwork() {
int vertexCount = 8;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// Setting up a large network
capacity[0][1] = 10;
capacity[0][2] = 5;
capacity[1][3] = 15;
capacity[2][3] = 10;
capacity[1][4] = 10;
capacity[3][5] = 10;
capacity[4][5] = 5;
capacity[4][6] = 10;
capacity[5][7] = 10;
capacity[6][7] = 15;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 7);
assertEquals(15, maxFlow); // Maximum flow should be 15
}
@Test
public void testMultipleSourcesAndSinks() {
int vertexCount = 7;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// Creating multiple sources and sinks scenario
capacity[0][1] = 10; // Source 1
capacity[0][2] = 5;
capacity[1][3] = 15;
capacity[2][3] = 10;
capacity[3][4] = 10; // Sink 1
capacity[3][5] = 5;
capacity[3][6] = 10; // Sink 2
capacity[5][6] = 10;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 4);
assertEquals(10, maxFlow); // Maximum flow should be 10
}
@Test
public void testDisconnectedGraph() {
int vertexCount = 6;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// No connection between source and sink
capacity[0][1] = 10; // Only one edge not connected to the sink
capacity[1][2] = 10;
capacity[3][4] = 10;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 5);
assertEquals(0, maxFlow); // No flow should be possible
}
@Test
public void testZeroCapacityEdge() {
int vertexCount = 4;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// Including a zero capacity edge
capacity[0][1] = 10;
capacity[0][2] = 0; // Zero capacity
capacity[1][3] = 5;
capacity[2][3] = 10;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 3);
assertEquals(5, maxFlow); // Flow only possible through 0 -> 1 -> 3
}
@Test
public void testAllEdgesZeroCapacity() {
int vertexCount = 5;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// All edges with zero capacity
capacity[0][1] = 0;
capacity[1][2] = 0;
capacity[2][3] = 0;
capacity[3][4] = 0;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 4);
assertEquals(0, maxFlow); // No flow should be possible
}
@Test
public void testCycleGraph() {
int vertexCount = 4;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// Setting up a cycle
capacity[0][1] = 10;
capacity[1][2] = 5;
capacity[2][0] = 5; // This creates a cycle
capacity[1][3] = 15;
capacity[2][3] = 10;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 3);
assertEquals(10, maxFlow); // Maximum flow should be 10
}
@Test
public void testFlowWithExcessCapacity() {
int vertexCount = 5;
int[][] capacity = new int[vertexCount][vertexCount];
int[][] flow = new int[vertexCount][vertexCount];
// Extra capacity in the flow
capacity[0][1] = 20;
capacity[1][2] = 10;
capacity[2][3] = 15;
capacity[1][3] = 5;
int maxFlow = FordFulkerson.networkFlow(vertexCount, capacity, flow, 0, 3);
assertEquals(15, maxFlow); // Maximum flow should be 15 (20 from 0->1 and 10->2, limited by 15->3)
}
}