Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

testing: improving test coverageDisjointSetUnionTest#6394

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.

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

Already on GitHub?Sign in to your account

Merged
Merged
Changes fromall commits
Commits
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
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
packagecom.thealgorithms.datastructures.disjointsetunion;

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

importorg.junit.jupiter.api.Assertions;
importorg.junit.jupiter.api.Test;

publicclassDisjointSetUnionTest {
Expand All@@ -12,7 +13,7 @@ public void testMakeSet() {
DisjointSetUnion<Integer>dsu =newDisjointSetUnion<>();
Node<Integer>node =dsu.makeSet(1);
assertNotNull(node);
Assertions.assertEquals(node,node.parent);
assertEquals(node,node.parent);
}

@Test
Expand All@@ -33,19 +34,92 @@ public void testUnionFindSet() {
Node<Integer>root3 =dsu.findSet(node3);
Node<Integer>root4 =dsu.findSet(node4);

Assertions.assertEquals(node1,node1.parent);
Assertions.assertEquals(node1,node2.parent);
Assertions.assertEquals(node1,node3.parent);
Assertions.assertEquals(node1,node4.parent);
assertEquals(node1,node1.parent);
assertEquals(node1,node2.parent);
assertEquals(node1,node3.parent);
assertEquals(node1,node4.parent);

Assertions.assertEquals(node1,root1);
Assertions.assertEquals(node1,root2);
Assertions.assertEquals(node1,root3);
Assertions.assertEquals(node1,root4);
assertEquals(node1,root1);
assertEquals(node1,root2);
assertEquals(node1,root3);
assertEquals(node1,root4);

Assertions.assertEquals(1,node1.rank);
Assertions.assertEquals(0,node2.rank);
Assertions.assertEquals(0,node3.rank);
Assertions.assertEquals(0,node4.rank);
assertEquals(1,node1.rank);
assertEquals(0,node2.rank);
assertEquals(0,node3.rank);
assertEquals(0,node4.rank);
}

@Test
publicvoidtestFindSetOnSingleNode() {
DisjointSetUnion<String>dsu =newDisjointSetUnion<>();
Node<String>node =dsu.makeSet("A");
assertEquals(node,dsu.findSet(node));
}

@Test
publicvoidtestUnionAlreadyConnectedNodes() {
DisjointSetUnion<Integer>dsu =newDisjointSetUnion<>();
Node<Integer>node1 =dsu.makeSet(1);
Node<Integer>node2 =dsu.makeSet(2);
Node<Integer>node3 =dsu.makeSet(3);

dsu.unionSets(node1,node2);
dsu.unionSets(node2,node3);

// Union nodes that are already connected
dsu.unionSets(node1,node3);

// All should have the same root
Node<Integer>root =dsu.findSet(node1);
assertEquals(root,dsu.findSet(node2));
assertEquals(root,dsu.findSet(node3));
}

@Test
publicvoidtestRankIncrease() {
DisjointSetUnion<Integer>dsu =newDisjointSetUnion<>();
Node<Integer>node1 =dsu.makeSet(1);
Node<Integer>node2 =dsu.makeSet(2);
Node<Integer>node3 =dsu.makeSet(3);
Node<Integer>node4 =dsu.makeSet(4);

dsu.unionSets(node1,node2);// rank of node1 should increase
dsu.unionSets(node3,node4);// rank of node3 should increase
dsu.unionSets(node1,node3);// union two trees of same rank -> rank increases

assertEquals(2,dsu.findSet(node1).rank);
}

@Test
publicvoidtestMultipleMakeSets() {
DisjointSetUnion<Integer>dsu =newDisjointSetUnion<>();
Node<Integer>node1 =dsu.makeSet(1);
Node<Integer>node2 =dsu.makeSet(2);
Node<Integer>node3 =dsu.makeSet(3);

assertNotEquals(node1,node2);
assertNotEquals(node2,node3);
assertNotEquals(node1,node3);

assertEquals(node1,node1.parent);
assertEquals(node2,node2.parent);
assertEquals(node3,node3.parent);
}

@Test
publicvoidtestPathCompression() {
DisjointSetUnion<Integer>dsu =newDisjointSetUnion<>();
Node<Integer>node1 =dsu.makeSet(1);
Node<Integer>node2 =dsu.makeSet(2);
Node<Integer>node3 =dsu.makeSet(3);

dsu.unionSets(node1,node2);
dsu.unionSets(node2,node3);

// After findSet, path compression should update parent to root directly
Node<Integer>root =dsu.findSet(node3);
assertEquals(root,node1);
assertEquals(node1,node3.parent);
}
}
[8]ページ先頭
©2009-2025 Movatter.jp