algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enhance docs, remove main, add tests in PrimMST (#5969)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-26 23:40:19 +05:30
committed by GitHub
parent ce3dd01e68
commit 62c9309a31
3 changed files with 72 additions and 66 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
src/test/java/com/thealgorithms/datastructures/graphs/PrimMSTTest.java Normal file
View File

@@ -0,0 +1,54 @@
package com.thealgorithms.datastructures.graphs;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
public class PrimMSTTest {
private final PrimMST primMST = new PrimMST();
@Test
public void testSimpleGraph() {
// Test graph with 5 nodes and weighted edges
int[][] graph = {{0, 2, 0, 6, 0}, {2, 0, 3, 8, 5}, {0, 3, 0, 0, 7}, {6, 8, 0, 0, 9}, {0, 5, 7, 9, 0}};
int[] expectedParent = {-1, 0, 1, 0, 1};
int[] actualParent = primMST.primMST(graph);
assertArrayEquals(expectedParent, actualParent);
}
@Test
public void testDisconnectedGraph() {
// Test case with a disconnected graph (no valid MST)
int[][] graph = {{0, 1, 0, 0, 0}, {1, 0, 2, 0, 0}, {0, 2, 0, 3, 0}, {0, 0, 3, 0, 4}, {0, 0, 0, 4, 0}};
int[] expectedParent = {-1, 0, 1, 2, 3}; // Expected MST parent array
int[] actualParent = primMST.primMST(graph);
assertArrayEquals(expectedParent, actualParent);
}
@Test
public void testAllEqualWeightsGraph() {
// Test case where all edges have equal weight
int[][] graph = {{0, 1, 1, 1, 1}, {1, 0, 1, 1, 1}, {1, 1, 0, 1, 1}, {1, 1, 1, 0, 1}, {1, 1, 1, 1, 0}};
int[] expectedParent = {-1, 0, 0, 0, 0}; // Expected MST parent array (any valid spanning tree)
int[] actualParent = primMST.primMST(graph);
assertArrayEquals(expectedParent, actualParent);
}
@Test
public void testSparseGraph() {
// Test case with a sparse graph (few edges)
int[][] graph = {{0, 1, 0, 0, 0}, {1, 0, 1, 0, 0}, {0, 1, 0, 1, 0}, {0, 0, 1, 0, 1}, {0, 0, 0, 1, 0}};
int[] expectedParent = {-1, 0, 1, 2, 3}; // Expected MST parent array
int[] actualParent = primMST.primMST(graph);
assertArrayEquals(expectedParent, actualParent);
}
}