Rewrite UnionFind find to use early-return == style

williamfiset · claude · williamfiset · commit e6cac02d2beb · 2026-03-16T17:22:18.000-07:00
Co-Authored-By: Claude Opus 4.6 &lt;noreply@anthropic.com&gt;
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java b/src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java
@@ -172,10 +172,10 @@ public UnionFind(int n) {
     }
 
     public int find(int p) {
-      if (id[p] != p) {
-        id[p] = find(id[p]);
+      if (id[p] == p) {
+        return p;
       }
-      return id[p];
+      return id[p] = find(id[p]);
     }
 
     public void union(int p, int q) {
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java b/src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java
@@ -137,10 +137,10 @@ private static class UnionFind {
     }
 
     int find(int p) {
-      if (id[p] != p) {
-        id[p] = find(id[p]);
+      if (id[p] == p) {
+        return p;
       }
-      return id[p];
+      return id[p] = find(id[p]);
     }
 
     void union(int p, int q) {

Original file line number	Diff line number	Diff line change
`@@ -137,10 +137,10 @@ private static class UnionFind {`
`137`	`137`	`}`
`138`	`138`
`139`	`139`	`int find(int p) {`
`140`		`- if (id[p] != p) {`
`141`		`- id[p] = find(id[p]);`
	`140`	`+ if (id[p] == p) {`
	`141`	`+ return p;`
`142`	`142`	`}`
`143`		`- return id[p];`
	`143`	`+ return id[p] = find(id[p]);`
`144`	`144`	`}`
`145`	`145`
`146`	`146`	`void union(int p, int q) {`