Merge branch 'master' into btree

Author: raklaptudirm

.github/CODEOWNERS

@@ -7,4 +7,4 @@
 
 # Order is important. The last matching pattern has the most precedence.
 
-* @raklaptudirm @tjgurwara99 @yanglbme
+* @raklaptudirm @yanglbme

graph/kruskal.go

@@ -28,12 +28,6 @@ func KruskalMST(n int, edges []Edge) ([]Edge, int) {
 	// Create a new UnionFind data structure with 'n' nodes
 	u := NewUnionFind(n)
 
-	// Initialize each node in the UnionFind data structure
-	for i := 0; i < n; i++ {
-		u.parent[i] = i
-		u.size[i] = 1
-	}
-
 	// Sort the edges in non-decreasing order based on their weights
 	sort.SliceStable(edges, func(i, j int) bool {
 		return edges[i].Weight < edges[j].Weight