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

Improve comments in Mcoloring.java (#5484)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-02 19:16:34 +05:30
committed by GitHub
parent 0bd86b3d7e
commit dab8ff3d1d
2 changed files with 49 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
src/test/java/com/thealgorithms/backtracking/MColoringTest.java
View File

@ -1,6 +1,7 @@
package com.thealgorithms.backtracking;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertFalse;
import static org.junit.jupiter.api.Assertions.assertTrue;
import java.util.ArrayList;
import org.junit.jupiter.api.Test;
@ -16,7 +17,7 @@ class MColoringTest {
int[][] graph = {{0, 1, 1, 1}, {1, 0, 1, 0}, {1, 1, 0, 1}, {1, 0, 1, 0}};
int m = 3; // Number of colors
assertEquals(1, MColoring.possiblePaint(createGraph(graph), n, m));
assertTrue(MColoring.isColoringPossible(createGraph(graph), n, m));
}
@Test
@ -25,7 +26,7 @@ class MColoringTest {
int[][] graph = {{0, 1, 1, 1, 0}, {1, 0, 0, 1, 0}, {1, 0, 0, 1, 1}, {1, 1, 1, 0, 1}, {0, 0, 1, 1, 0}};
int m = 2; // Number of colors
assertEquals(0, MColoring.possiblePaint(createGraph(graph), n, m));
assertFalse(MColoring.isColoringPossible(createGraph(graph), n, m));
}
@Test
@ -34,7 +35,7 @@ class MColoringTest {
int[][] graph = {{0, 1, 1}, {1, 0, 1}, {1, 1, 0}};
int m = 2; // Number of colors
assertEquals(0, MColoring.possiblePaint(createGraph(graph), n, m));
assertFalse(MColoring.isColoringPossible(createGraph(graph), n, m));
}
private ArrayList<Node> createGraph(int[][] graph) {