@graphty/algorithms 1.7.0 → 1.7.2

package/dist/algorithms.js

@@ -2093,7 +2093,7 @@ var hasRequiredLib;
 function requireLib() {
   if (hasRequiredLib) return lib;
   hasRequiredLib = 1;
-  (function(exports$1) {
+  (function(exports) {
     var __createBinding = lib && lib.__createBinding || (Object.create ? (function(o, m, k, k2) {
       if (k2 === void 0) k2 = k;
       var desc = Object.getOwnPropertyDescriptor(m, k);
@@ -2107,12 +2107,12 @@ function requireLib() {
       if (k2 === void 0) k2 = k;
       o[k2] = m[k];
     }));
-    var __exportStar = lib && lib.__exportStar || function(m, exports$12) {
-      for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports$12, p)) __createBinding(exports$12, m, p);
+    var __exportStar = lib && lib.__exportStar || function(m, exports2) {
+      for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports2, p)) __createBinding(exports2, m, p);
     };
-    Object.defineProperty(exports$1, "__esModule", { value: true });
-    __exportStar(requireSparseTypedFastBitSet(), exports$1);
-    __exportStar(requireTypedFastBitSet(), exports$1);
+    Object.defineProperty(exports, "__esModule", { value: true });
+    __exportStar(requireSparseTypedFastBitSet(), exports);
+    __exportStar(requireTypedFastBitSet(), exports);
   })(lib);
   return lib;
 }
@@ -9291,7 +9291,8 @@ function calculateMCLModularity(graph, communities) {
   return modularity / (2 * m);
 }
 function spectralClustering(graph, options) {
-  const { k, laplacianType = "normalized", maxIterations = 100, tolerance = 1e-4 } = options;
+  const { k, laplacianType = "normalized", maxIterations = 100, tolerance = 1e-4, seed } = options;
+  const random = seed !== void 0 ? SeededRandom.createGenerator(seed) : Math.random;
   if (k < 1 || !Number.isInteger(k)) {
     throw new Error("k must be a positive integer");
   }
@@ -9306,7 +9307,7 @@ function spectralClustering(graph, options) {
   }
   const adjacencyMatrix = buildAdjacencyMatrix(graph, nodeIds);
   const laplacianMatrix = buildLaplacianMatrix(adjacencyMatrix, laplacianType);
-  const eigenResult = findSmallestEigenvectors(laplacianMatrix, k);
+  const eigenResult = findSmallestEigenvectors(laplacianMatrix, k, random);
   const dataPoints = [];
   for (let i = 0; i < nodeIds.length; i++) {
     const point = [];
@@ -9321,7 +9322,7 @@ function spectralClustering(graph, options) {
   if (laplacianType === "normalized") {
     normalizeRows(dataPoints);
   }
-  const kmeans = kMeansClustering(dataPoints, k, maxIterations, tolerance);
+  const kmeans = kMeansClustering(dataPoints, k, maxIterations, tolerance, random);
   const communities = Array.from({ length: k }, () => []);
   const clusterAssignments = /* @__PURE__ */ new Map();
   for (let i = 0; i < nodeIds.length; i++) {
@@ -9472,19 +9473,19 @@ function buildLaplacianMatrix(adjacency, type) {
   }
   return laplacian;
 }
-function findSmallestEigenvectors(matrix, k) {
+function findSmallestEigenvectors(matrix, k, random) {
   const n = matrix.length;
   if (n === 0 || k === 0) {
     return { eigenvalues: [], eigenvectors: [] };
   }
   if (k <= 3 && n > k) {
-    return computeSmallestEigenvectorsSimple(matrix, k, n);
+    return computeSmallestEigenvectorsSimple(matrix, k, n, random);
   }
   const eigenvectors = [];
   const eigenvalues = [];
   const maxIterations = 100;
   for (let eigIdx = 0; eigIdx < k; eigIdx++) {
-    let vector = Array(n).fill(0).map(() => Math.random() - 0.5);
+    let vector = Array(n).fill(0).map(() => random() - 0.5);
     const initNorm = Math.sqrt(vector.reduce((sum, val) => sum + val * val, 0));
     if (initNorm > 0) {
       vector = vector.map((val) => val / initNorm);
@@ -9572,7 +9573,7 @@ function normalizeRows(matrix) {
     }
   }
 }
-function kMeansClustering(data, k, maxIterations, tolerance = 1e-4) {
+function kMeansClustering(data, k, maxIterations, tolerance = 1e-4, random = Math.random) {
   const n = data.length;
   const d = data[0]?.length ?? 0;
   if (n === 0 || k === 0) {
@@ -9587,7 +9588,7 @@ function kMeansClustering(data, k, maxIterations, tolerance = 1e-4) {
   const centroids = [];
   const selectedIndices = /* @__PURE__ */ new Set();
   while (centroids.length < k && selectedIndices.size < n) {
-    const idx = Math.floor(Math.random() * n);
+    const idx = Math.floor(random() * n);
     if (!selectedIndices.has(idx) && data[idx]) {
       selectedIndices.add(idx);
       centroids.push([...data[idx]]);
@@ -9596,7 +9597,7 @@ function kMeansClustering(data, k, maxIterations, tolerance = 1e-4) {
   while (centroids.length < k) {
     const centroid = Array(d).fill(0);
     for (let j = 0; j < d; j++) {
-      centroid[j] = Math.random() - 0.5;
+      centroid[j] = random() - 0.5;
     }
     centroids.push(centroid);
   }
@@ -9692,7 +9693,7 @@ function kMeansClustering(data, k, maxIterations, tolerance = 1e-4) {
   }
   return { assignments, centroids };
 }
-function computeSmallestEigenvectorsSimple(matrix, k, n) {
+function computeSmallestEigenvectorsSimple(matrix, k, n, random) {
   const eigenvectors = [];
   const eigenvalues = [];
   const firstVector = Array(n).fill(1 / Math.sqrt(n));
@@ -9700,7 +9701,7 @@ function computeSmallestEigenvectorsSimple(matrix, k, n) {
   eigenvalues.push(0);
   if (k >= 2) {
     const maxEig = 2;
-    let vector = Array(n).fill(0).map(() => Math.random() - 0.5);
+    let vector = Array(n).fill(0).map(() => random() - 0.5);
     const dot1 = vector.reduce((sum, val) => sum + val / Math.sqrt(n), 0);
     vector = vector.map((val) => val - dot1 / Math.sqrt(n));
     for (let iter = 0; iter < 100; iter++) {
@@ -9728,7 +9729,7 @@ function computeSmallestEigenvectorsSimple(matrix, k, n) {
     eigenvalues.push(0.1);
   }
   if (k >= 3) {
-    let vector = Array(n).fill(0).map(() => Math.random() - 0.5);
+    let vector = Array(n).fill(0).map(() => random() - 0.5);
     for (const prev of eigenvectors) {
       const dot = vector.reduce((sum, val, idx) => sum + val * (prev[idx] ?? 0), 0);
       vector = vector.map((val, idx) => val - dot * (prev[idx] ?? 0));