MinimumPathSumTest.java

packagecom.thealgorithms.dynamicprogramming;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

importorg.junit.jupiter.api.Test;

publicclassMinimumPathSumTest {

@Test
publicvoidtestMinimumPathSumWithRegularGrid() {
int[][] grid = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
assertEquals(7, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumWithOneRowOneColumnGrid() {
int[][] grid = {{2}};
assertEquals(2, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumWithEmptyGrid() {
int[][] grid = {{}};
assertEquals(0, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumWithOneColumnGrid() {
int[][] grid = {{1}, {2}, {3}};
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumGridOneRowGrid() {
int[][] grid = {{1, 2, 3}};
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumWithDiffRowAndColumnGrid() {
int[][] grid = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};
assertEquals(30, MinimumPathSum.minimumPathSum(grid));
 }

@Test
publicvoidtestMinimumPathSumWithNegativeNumberGrid() {
int[][] grid = {{1, 3, 1}, {3, 4, 1}, {4, -3, 1}};
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
 }
}