Skip to content

Add unit tests for Minimum Path Sum algorithm #4233

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Jul 9, 2023
Merged

Add unit tests for Minimum Path Sum algorithm #4233

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
cc3e7d2
Add unit tests for Minimum Path Sum algorithm
ngominhtrint Jul 9, 2023
a48ccf5
fix lint issues
ngominhtrint Jul 9, 2023
176bde4
fix lint issues
ngominhtrint Jul 9, 2023
a8f59d9
fix clang lint issue
ngominhtrint Jul 9, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Add unit tests for Minimum Path Sum algorithm
  • Loading branch information
@ngominhtrint
ngominhtrint committed Jul 9, 2023
commit cc3e7d20c2a5cf1a2df992fa101ebd725c65ef9c
61 changes: 61 additions & 0 deletions src/test/java/com/thealgorithms/dynamicprogramming/MinimumPathSumTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,61 @@
package com.thealgorithms.dynamicprogramming;

import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;

public class MinimumPathSumTest {

@Test
public void testMinimumPathSum_Regular() {
// Given
int[][] grid = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};

// Then
assertEquals(7, MinimumPathSum.minimumPathSum(grid));
}

@Test
public void testMinimumPathSum_OneRowOneColumn() {
// Given
int[][] grid = {{2}};

// Then
assertEquals(2, MinimumPathSum.minimumPathSum(grid));
}

@Test
public void testMinimumPathSum_EmptyGrid() {
// Given
int[][] grid = {{}};

// Then
assertEquals(0, MinimumPathSum.minimumPathSum(grid));
}

@Test
public void testMinimumPathSum_OneColumn() {
// Given
int[][] grid = {{1}, {2}, {3}};

// Then
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
}

@Test
public void testMinimumPathSum_OneRow() {
// Given
int[][] grid = {{1, 2, 3}};

// Then
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
}

@Test
public void testMinimumPathSum_DiffRowAndColumn() {
// Given
int[][] grid = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};

// Then
assertEquals(30, MinimumPathSum.minimumPathSum(grid));
}
}