Merge branch 'main' into feat/bellman

Author: akash205sharma

src/App.jsx

@@ -1,14 +1,16 @@
 import React from "react";
 import { BrowserRouter as Router, Routes, Route } from "react-router-dom";
-import Homepage from "./pages/Homepage";
+import UnionFindPage from "../src/pages/graph/UnionFind.jsx"; // ✅ Import Union-Find Page
 import SortingPage from "./pages/sorting/SortingPage";
 import GraphPage from "./pages/graph/GraphPage";
+import Homepage from "./pages/Homepage.jsx";
 
 function App() {
   return (
     <Router>
       <Routes>
         <Route path="/" element={<Homepage />} />
+        <Route path="/graph/union-find" element={<UnionFindPage />} /> {/* ✅ Added route */}
         <Route path="/sorting" element={<SortingPage />} />
         <Route path="/graph" element={<GraphPage />} />
       </Routes>

src/algorithms/graph/unionFind.js

@@ -0,0 +1,72 @@
+// src/algorithms/graph/unionFind.js
+
+class UnionFind {
+  constructor(n) {
+    this.parent = Array.from({ length: n }, (_, i) => i);
+    this.rank = Array(n).fill(0);
+    this.steps = []; // For visualization steps
+  }
+
+  find(x) {
+    this.steps.push({ type: "find-start", node: x });
+    if (this.parent[x] !== x) {
+      const root = this.find(this.parent[x]);
+      this.steps.push({
+        type: "path-compression",
+        node: x,
+        newParent: root,
+      });
+      this.parent[x] = root;
+    }
+    this.steps.push({ type: "find-end", node: x, root: this.parent[x] });
+    return this.parent[x];
+  }
+
+  union(x, y) {
+    const rootX = this.find(x);
+    const rootY = this.find(y);
+
+    this.steps.push({
+      type: "union-start",
+      x,
+      y,
+      rootX,
+      rootY,
+    });
+
+    if (rootX === rootY) {
+      this.steps.push({ type: "same-set", x, y });
+      return;
+    }
+
+    if (this.rank[rootX] < this.rank[rootY]) {
+      this.parent[rootX] = rootY;
+      this.steps.push({
+        type: "union",
+        parent: rootY,
+        child: rootX,
+      });
+    } else if (this.rank[rootX] > this.rank[rootY]) {
+      this.parent[rootY] = rootX;
+      this.steps.push({
+        type: "union",
+        parent: rootX,
+        child: rootY,
+      });
+    } else {
+      this.parent[rootY] = rootX;
+      this.rank[rootX]++;
+      this.steps.push({
+        type: "union-rank",
+        parent: rootX,
+        child: rootY,
+      });
+    }
+  }
+
+  getSteps() {
+    return this.steps;
+  }
+}
+
+export default UnionFind;