@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/research/sync.js

@@ -1,4 +1,15 @@
-import { euclideanDistance, SeededRandom } from "../utils/math-utilities.js";
+/**
+ * SynC (Synergistic Deep Graph Clustering) over a legacy `Graph`. `syncClustering` delegates to
+ * `indexed.syncClustering` over an unweighted snapshot of the graph (SynC never reads a weight);
+ * clusters, embeddings, loss, iterations and convergence equal the pre-migration implementation in
+ * `sync-legacy.ts`, the floats to rounding. A run that diverges (a large learning rate) amplifies
+ * that rounding, so its embeddings and loss can differ from the old code's in the leading digits. A
+ * cluster count that is not an integer keeps the old code, which mostly fails on one ("Invalid array
+ * length"). Unlike the old code the port never replaces `Math.random`.
+ */
+import { syncClustering as indexedSyncClustering } from "../indexed/sync.js";
+import { toTopologySnapshot } from "../indexed/to-snapshot.js";
+import { syncClustering as legacySyncClustering } from "./sync-legacy.js";
 /**
  * Synergistic Deep Graph Clustering (SynC) Algorithm
  *
@@ -12,326 +23,27 @@ import { euclideanDistance, SeededRandom } from "../utils/math-utilities.js";
  * @returns Clustering result with assignments and embeddings
  */
 export function syncClustering(graph, config) {
-    const { numClusters, maxIterations = 100, tolerance = 1e-6, seed = 42, learningRate = 0.01, lambda = 0.1 } = config;
-    // Set random seed for reproducibility (save original)
-    const originalRandom = Math.random;
-    const rng = SeededRandom.createGenerator(seed);
-    Math.random = rng;
-    const nodes = Array.from(graph.nodes());
-    const nodeCount = nodes.length;
-    if (nodeCount === 0) {
-        return {
-            clusters: new Map(),
-            loss: 0,
-            iterations: 0,
-            embeddings: new Map(),
-            converged: true,
-        };
+    if (!Number.isInteger(config.numClusters)) {
+        return legacySyncClustering(graph, config);
     }
-    if (numClusters <= 0 || numClusters > nodeCount) {
-        throw new Error(`Invalid number of clusters: ${String(numClusters)}. Must be between 1 and ${String(nodeCount)}`);
-    }
-    // Initialize node embeddings (simplified version using graph features)
-    const embeddingDim = Math.min(64, nodeCount);
+    const s = toTopologySnapshot(graph);
+    const n = s.nodeCount;
+    const r = indexedSyncClustering(s, config);
+    const clusters = new Map();
     const embeddings = new Map();
-    // Initialize embeddings based on node features
-    for (const node of nodes) {
-        const embedding = initializeNodeEmbedding(graph, node.id, embeddingDim);
-        embeddings.set(node.id, embedding);
-    }
-    // Initialize cluster centers
-    const clusterCenters = initializeClusterCenters(embeddings, numClusters);
-    let previousLoss = Infinity;
-    let iterations = 0;
-    let converged = false;
-    for (iterations = 0; iterations < maxIterations; iterations++) {
-        // E-step: Assign nodes to clusters
-        const clusters = new Map();
-        for (const node of nodes) {
-            const nodeEmbedding = embeddings.get(node.id);
-            if (!nodeEmbedding) {
-                continue;
-            }
-            let bestCluster = 0;
-            let minDistance = Infinity;
-            for (let k = 0; k < numClusters; k++) {
-                const center = clusterCenters[k];
-                if (!center) {
-                    continue;
-                }
-                const distance = euclideanDistance(nodeEmbedding, center);
-                if (distance < minDistance) {
-                    minDistance = distance;
-                    bestCluster = k;
-                }
-            }
-            clusters.set(node.id, bestCluster);
-        }
-        // M-step: Update embeddings and cluster centers
-        updateEmbeddings(graph, embeddings, clusters, learningRate, lambda);
-        updateClusterCenters(embeddings, clusters, clusterCenters, numClusters);
-        // Calculate current loss
-        const currentLoss = calculateLoss(graph, embeddings, clusters, clusterCenters, lambda);
-        // Check for convergence
-        if (Math.abs(previousLoss - currentLoss) < tolerance) {
-            converged = true;
-            break;
-        }
-        previousLoss = currentLoss;
+    for (let i = 0; i < n; i++) {
+        const id = s.ids.idOf(i);
+        clusters.set(id, r.labels[i]);
+        embeddings.set(id, Array.from(r.embeddings.subarray(i * r.dimensions, (i + 1) * r.dimensions)));
     }
-    // Final cluster assignment
-    const finalClusters = new Map();
-    for (const node of nodes) {
-        const nodeEmbedding = embeddings.get(node.id);
-        if (!nodeEmbedding) {
-            continue;
-        }
-        let bestCluster = 0;
-        let minDistance = Infinity;
-        for (let k = 0; k < numClusters; k++) {
-            const center = clusterCenters[k];
-            if (!center) {
-                continue;
-            }
-            const distance = euclideanDistance(nodeEmbedding, center);
-            if (distance < minDistance) {
-                minDistance = distance;
-                bestCluster = k;
-            }
-        }
-        finalClusters.set(node.id, bestCluster);
-    }
-    // Restore original random function
-    Math.random = originalRandom;
     return {
-        clusters: finalClusters,
-        loss: previousLoss,
-        iterations: iterations + 1,
+        clusters,
+        // The old code reported the loss of the round before the converging one.
+        loss: r.converged && r.iterations > 1 ? r.previousLoss : r.loss,
+        // ...and one round more than it ran when it stopped at the cap.
+        iterations: r.iterations + (r.converged ? 0 : 1),
         embeddings,
-        converged,
+        converged: r.converged,
     };
 }
-/**
- * Initialize node embedding based on graph structure and features
- * @param graph - The input graph
- * @param nodeId - The node ID to initialize embedding for
- * @param dim - The embedding dimension
- * @returns The initialized embedding vector
- */
-function initializeNodeEmbedding(graph, nodeId, dim) {
-    const embedding = new Array(dim).fill(0);
-    // Use node degree as a base feature
-    const degree = graph.degree(nodeId);
-    const normalizedDegree = degree / Math.max(1, graph.nodeCount - 1);
-    // Initialize with small random values influenced by graph structure
-    for (let i = 0; i < dim; i++) {
-        embedding[i] = (Math.random() - 0.5) * 0.1 + normalizedDegree * 0.1;
-    }
-    return embedding;
-}
-/**
- * Initialize cluster centers using k-means++ style initialization
- * @param embeddings - Map of node IDs to embedding vectors
- * @param numClusters - Number of cluster centers to initialize
- * @returns Array of initialized cluster center vectors
- */
-function initializeClusterCenters(embeddings, numClusters) {
-    const embeddingArray = Array.from(embeddings.values());
-    const centers = [];
-    // Choose first center randomly
-    const firstCenter = embeddingArray[Math.floor(Math.random() * embeddingArray.length)];
-    if (firstCenter) {
-        centers.push([...firstCenter]);
-    }
-    // Choose remaining centers using k-means++ initialization
-    for (let k = 1; k < numClusters; k++) {
-        const distances = [];
-        let totalDistance = 0;
-        for (const embedding of embeddingArray) {
-            let minDistance = Infinity;
-            for (const center of centers) {
-                const distance = euclideanDistance(embedding, center);
-                minDistance = Math.min(minDistance, distance);
-            }
-            distances.push(minDistance * minDistance);
-            totalDistance += minDistance * minDistance;
-        }
-        // Choose next center with probability proportional to squared distance
-        let randomValue = Math.random() * totalDistance;
-        for (let i = 0; i < embeddingArray.length; i++) {
-            const distanceValue = distances[i];
-            if (distanceValue !== undefined) {
-                randomValue -= distanceValue;
-            }
-            if (randomValue <= 0) {
-                const newCenter = embeddingArray[i];
-                if (newCenter) {
-                    centers.push([...newCenter]);
-                }
-                break;
-            }
-        }
-    }
-    return centers;
-}
-/**
- * Update node embeddings using gradient descent
- * @param graph - The input graph
- * @param embeddings - Map of node IDs to embedding vectors
- * @param _clusters - Map of node IDs to cluster assignments (reserved for future use)
- * @param learningRate - Learning rate for gradient descent
- * @param lambda - Regularization parameter
- */
-function updateEmbeddings(graph, embeddings, _clusters, learningRate, lambda) {
-    const gradients = new Map();
-    // Initialize gradients
-    for (const [nodeId, embedding] of embeddings) {
-        gradients.set(nodeId, new Array(embedding.length).fill(0));
-    }
-    // Calculate gradients based on graph structure (simplified)
-    for (const node of graph.nodes()) {
-        const nodeId = node.id;
-        const nodeEmbedding = embeddings.get(nodeId);
-        if (!nodeEmbedding) {
-            continue;
-        }
-        const gradient = gradients.get(nodeId);
-        if (!gradient) {
-            continue;
-        }
-        // Neighbor reconstruction loss gradient
-        for (const neighborId of graph.neighbors(nodeId)) {
-            const neighborEmbedding = embeddings.get(neighborId);
-            if (!neighborEmbedding) {
-                continue;
-            }
-            const diff = nodeEmbedding.map((val, i) => val - (neighborEmbedding[i] ?? 0));
-            for (let i = 0; i < gradient.length; i++) {
-                const gradVal = gradient[i];
-                const diffVal = diff[i];
-                if (gradVal !== undefined && diffVal !== undefined) {
-                    gradient[i] = gradVal + lambda * diffVal;
-                }
-            }
-        }
-        // Regularization gradient
-        for (let i = 0; i < gradient.length; i++) {
-            const gradVal = gradient[i];
-            const nodeVal = nodeEmbedding[i];
-            if (gradVal !== undefined && nodeVal !== undefined) {
-                gradient[i] = gradVal + lambda * nodeVal;
-            }
-        }
-    }
-    // Update embeddings
-    for (const [nodeId, embedding] of embeddings) {
-        const gradient = gradients.get(nodeId);
-        if (!gradient) {
-            continue;
-        }
-        for (let i = 0; i < embedding.length; i++) {
-            const embVal = embedding[i];
-            const gradVal = gradient[i];
-            if (embVal !== undefined && gradVal !== undefined) {
-                embedding[i] = embVal - learningRate * gradVal;
-            }
-        }
-    }
-}
-/**
- * Update cluster centers based on current assignments
- * @param embeddings - Map of node IDs to embedding vectors
- * @param clusters - Map of node IDs to cluster assignments
- * @param clusterCenters - Array of cluster center vectors to update
- * @param numClusters - Number of clusters
- */
-function updateClusterCenters(embeddings, clusters, clusterCenters, numClusters) {
-    const dimensions = clusterCenters[0]?.length ?? 0;
-    const clusterSums = Array.from({ length: numClusters }, () => new Array(dimensions).fill(0));
-    const clusterCounts = new Array(numClusters).fill(0);
-    // Sum embeddings for each cluster
-    for (const [nodeId, clusterIdx] of clusters) {
-        const embedding = embeddings.get(nodeId);
-        if (!embedding) {
-            continue;
-        }
-        for (let i = 0; i < embedding.length; i++) {
-            const clusterSum = clusterSums[clusterIdx];
-            if (!clusterSum) {
-                continue;
-            }
-            const sumVal = clusterSum[i];
-            const embVal = embedding[i];
-            if (sumVal !== undefined && embVal !== undefined) {
-                clusterSum[i] = sumVal + embVal;
-            }
-        }
-        if (clusterCounts[clusterIdx] !== undefined) {
-            clusterCounts[clusterIdx]++;
-        }
-    }
-    // Update cluster centers (average of assigned embeddings)
-    for (let k = 0; k < numClusters; k++) {
-        const count = clusterCounts[k];
-        const center = clusterCenters[k];
-        const sum = clusterSums[k];
-        if (count !== undefined && count > 0 && center && sum) {
-            for (let i = 0; i < center.length; i++) {
-                const sumVal = sum[i];
-                if (sumVal !== undefined) {
-                    center[i] = sumVal / count;
-                }
-            }
-        }
-    }
-}
-/**
- * Calculate the total loss function
- * @param graph - The input graph
- * @param embeddings - Map of node IDs to embedding vectors
- * @param clusters - Map of node IDs to cluster assignments
- * @param clusterCenters - Array of cluster center vectors
- * @param lambda - Regularization parameter
- * @returns The total loss value
- */
-function calculateLoss(graph, embeddings, clusters, clusterCenters, lambda) {
-    let clusteringLoss = 0;
-    let reconstructionLoss = 0;
-    let regularizationLoss = 0;
-    // Clustering loss (distance to cluster centers)
-    for (const [nodeId, clusterIdx] of clusters) {
-        const embedding = embeddings.get(nodeId);
-        if (!embedding) {
-            continue;
-        }
-        const center = clusterCenters[clusterIdx];
-        if (!center) {
-            continue;
-        }
-        clusteringLoss += euclideanDistance(embedding, center) ** 2;
-    }
-    // Graph reconstruction loss
-    for (const node of graph.nodes()) {
-        const nodeId = node.id;
-        const nodeEmbedding = embeddings.get(nodeId);
-        if (!nodeEmbedding) {
-            continue;
-        }
-        for (const neighborId of graph.neighbors(nodeId)) {
-            const neighborEmbedding = embeddings.get(neighborId);
-            if (!neighborEmbedding) {
-                continue;
-            }
-            const distance = euclideanDistance(nodeEmbedding, neighborEmbedding);
-            reconstructionLoss += distance ** 2;
-        }
-    }
-    // Regularization loss
-    for (const embedding of embeddings.values()) {
-        for (const value of embedding) {
-            regularizationLoss += value ** 2;
-        }
-    }
-    return clusteringLoss + lambda * reconstructionLoss + lambda * regularizationLoss;
-}
 //# sourceMappingURL=sync.js.map

package/dist/src/research/sync.js.map

@@ -1 +1 @@
-{"version":3,"file":"sync.js","sourceRoot":"","sources":["../../../src/research/sync.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAoC7E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,MAAkB;IAC3D,MAAM,EAAE,WAAW,EAAE,aAAa,GAAG,GAAG,EAAE,SAAS,GAAG,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,GAAG,IAAI,EAAE,MAAM,GAAG,GAAG,EAAE,GAAG,MAAM,CAAC;IAEpH,sDAAsD;IACtD,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,MAAM,GAAG,GAAG,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IAElB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAE/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO;YACH,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,IAAI,EAAE,CAAC;YACP,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,SAAS,EAAE,IAAI;SAClB,CAAC;IACN,CAAC;IAED,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CACX,+BAA+B,MAAM,CAAC,WAAW,CAAC,2BAA2B,MAAM,CAAC,SAAS,CAAC,EAAE,CACnG,CAAC;IACN,CAAC;IAED,uEAAuE;IACvE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE/C,+CAA+C;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QACxE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACvC,CAAC;IAED,6BAA6B;IAC7B,MAAM,cAAc,GAAG,wBAAwB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IAEzE,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,KAAK,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,aAAa,EAAE,UAAU,EAAE,EAAE,CAAC;QAC5D,mCAAmC;QACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,IAAI,CAAC,aAAa,EAAE,CAAC;gBACjB,SAAS;YACb,CAAC;YAED,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,WAAW,GAAG,QAAQ,CAAC;YAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;gBACjC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACV,SAAS;gBACb,CAAC;gBAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;gBAC1D,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;oBACzB,WAAW,GAAG,QAAQ,CAAC;oBACvB,WAAW,GAAG,CAAC,CAAC;gBACpB,CAAC;YACL,CAAC;YAED,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QACvC,CAAC;QAED,gDAAgD;QAChD,gBAAgB,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QACpE,oBAAoB,CAAC,UAAU,EAAE,QAAQ,EAAE,cAAc,EAAE,WAAW,CAAC,CAAC;QAExE,yBAAyB;QACzB,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAEvF,wBAAwB;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,WAAW,CAAC,GAAG,SAAS,EAAE,CAAC;YACnD,SAAS,GAAG,IAAI,CAAC;YACjB,MAAM;QACV,CAAC;QAED,YAAY,GAAG,WAAW,CAAC;IAC/B,CAAC;IAED,2BAA2B;IAC3B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,SAAS;QACb,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,QAAQ,CAAC;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACV,SAAS;YACb,CAAC;YAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;YAC1D,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;gBACzB,WAAW,GAAG,QAAQ,CAAC;gBACvB,WAAW,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;QAED,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5C,CAAC;IAED,mCAAmC;IACnC,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC;IAE7B,OAAO;QACH,QAAQ,EAAE,aAAa;QACvB,IAAI,EAAE,YAAY;QAClB,UAAU,EAAE,UAAU,GAAG,CAAC;QAC1B,UAAU;QACV,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,KAAY,EAAE,MAAc,EAAE,GAAW;IACtE,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjD,oCAAoC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,gBAAgB,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAEnE,oEAAoE;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,gBAAgB,GAAG,GAAG,CAAC;IACxE,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,SAAS,wBAAwB,CAAC,UAAiC,EAAE,WAAmB;IACpF,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;IACvD,MAAM,OAAO,GAAe,EAAE,CAAC;IAE/B,+BAA+B;IAC/B,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IACtF,IAAI,WAAW,EAAE,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAa,CAAC,CAAC;IAC/C,CAAC;IAED,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;YACrC,IAAI,WAAW,GAAG,QAAQ,CAAC;YAC3B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC3B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACtD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAClD,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;YAC1C,aAAa,IAAI,WAAW,GAAG,WAAW,CAAC;QAC/C,CAAC;QAED,uEAAuE;QACvE,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,aAAa,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAC9B,WAAW,IAAI,aAAa,CAAC;YACjC,CAAC;YAED,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;gBACnB,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,SAAS,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAa,CAAC,CAAC;gBAC7C,CAAC;gBAED,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CACrB,KAAY,EACZ,UAAiC,EACjC,SAA8B,EAC9B,YAAoB,EACpB,MAAc;IAEd,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,uBAAuB;IACvB,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3C,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,KAAK,CAAS,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,4DAA4D;IAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,SAAS;QACb,CAAC;QAED,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,SAAS;QACb,CAAC;QAED,wCAAwC;QACxC,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,MAAM,iBAAiB,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACrD,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACrB,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAW,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE9F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBACjD,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;gBAC7C,CAAC;YACL,CAAC;QACL,CAAC;QAED,0BAA0B;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBACjD,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC;IAED,oBAAoB;IACpB,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,SAAS;QACb,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAChD,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,YAAY,GAAG,OAAO,CAAC;YACnD,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CACzB,UAAiC,EACjC,QAA6B,EAC7B,cAA0B,EAC1B,WAAmB;IAEnB,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;IAClD,MAAM,WAAW,GAAe,KAAK,CAAC,IAAI,CACtC,EAAE,MAAM,EAAE,WAAW,EAAE,EACvB,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAa,CAClD,CAAC;IACF,MAAM,aAAa,GAAG,IAAI,KAAK,CAAS,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7D,kCAAkC;IAClC,KAAK,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,CAAC,UAAU,EAAE,CAAC;gBACd,SAAS;YACb,CAAC;YAED,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC/C,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC;YACpC,CAAC;QACL,CAAC;QACD,IAAI,aAAa,CAAC,UAAU,CAAC,KAAK,SAAS,EAAE,CAAC;YAC1C,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,CAAC;IACL,CAAC;IAED,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,IAAI,GAAG,EAAE,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,CAAC;gBAC/B,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CAClB,KAAY,EACZ,UAAiC,EACjC,QAA6B,EAC7B,cAA0B,EAC1B,MAAc;IAEd,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAE3B,gDAAgD;IAChD,KAAK,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,SAAS;QACb,CAAC;QAED,cAAc,IAAI,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC;IAED,4BAA4B;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,SAAS;QACb,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,MAAM,iBAAiB,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACrD,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACrB,SAAS;YACb,CAAC;YAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,aAAa,EAAE,iBAAiB,CAAC,CAAC;YACrE,kBAAkB,IAAI,QAAQ,IAAI,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC5B,kBAAkB,IAAI,KAAK,IAAI,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,OAAO,cAAc,GAAG,MAAM,GAAG,kBAAkB,GAAG,MAAM,GAAG,kBAAkB,CAAC;AACtF,CAAC"}
+{"version":3,"file":"sync.js","sourceRoot":"","sources":["../../../src/research/sync.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,cAAc,IAAI,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAC7E,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/D,OAAO,EAAE,cAAc,IAAI,oBAAoB,EAAoC,MAAM,kBAAkB,CAAC;AAI5G;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,MAAkB;IAC3D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;QACxC,OAAO,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACD,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC;IACD,OAAO;QACH,QAAQ;QACR,yEAAyE;QACzE,IAAI,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC/D,gEAAgE;QAChE,UAAU,EAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,UAAU;QACV,SAAS,EAAE,CAAC,CAAC,SAAS;KACzB,CAAC;AACN,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/algorithms",
-  "version": "2.1.1",
+  "version": "2.2.0",
   "description": "Graph algorithms library for browser environments implemented in TypeScript",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/algorithms.js",
@@ -89,11 +89,12 @@
     "typescript-eslint": "^8.34.1",
     "vite": "^7.0.5",
     "vitepress": "^1.6.3",
-    "vitest": "4.1.11"
+    "vitest": "4.1.11",
+    "@graphty/graph-samples": "^0.1.8"
   },
   "dependencies": {
     "typedfastbitset": "^0.6.1",
-    "@graphty/graph-format": "^1.1.1"
+    "@graphty/graph-format": "^1.2.0"
   },
   "peerDependencies": {
     "@graphty/graph-format": "^1.0.0"

package/src/algorithms/centrality/betweenness.ts

@@ -1,4 +1,10 @@
 import type { Graph } from "../../core/graph.js";
+import {
+    betweennessCentrality as indexedBetweenness,
+    edgeBetweennessCentrality as indexedEdgeBetweenness,
+} from "../../indexed/betweenness.js";
+import { edgeScoresToPairMap, scoresToRecord } from "../../indexed/facade.js";
+import { needsLegacyCode, toSnapshot } from "../../indexed/to-snapshot.js";
 import type { NodeId } from "../../types/index.js";
 import { bfsWithPathCounting } from "../traversal/bfs-variants.js";
 
@@ -44,7 +50,8 @@ function rejectIndexOptions(options: BetweennessCentralityOptions, fn: string):
     if (options.sources !== undefined || options.k !== undefined) {
         throw new Error(
             `${fn}: 'sources' and 'k' are node INDICES and are meaningful only against a GraphSnapshot; ` +
-                "call accelerated(accelerator).betweennessCentrality(snapshot, options) instead",
+                "for sampled betweenness call indexed.betweennessCentrality(snapshot, options), or " +
+                "accelerated(accelerator).betweennessCentrality(snapshot, options) to use an AlgorithmAccelerator",
         );
     }
 }
@@ -226,6 +233,27 @@ function normalizeCentrality(centrality: Record<string, number>, nodeCount: numb
 export function betweennessCentrality(
     graph: Graph,
     options: BetweennessCentralityOptions = {},
+): Record<string, number> {
+    rejectIndexOptions(options, "betweennessCentrality");
+    if (needsLegacyCode(graph)) {
+        return legacyBetweennessCentrality(graph, options);
+    }
+    const s = toSnapshot(graph);
+    // `endpoints` is not passed on: the legacy accumulation accepts it and ignores it.
+    return scoresToRecord(s.ids, indexedBetweenness(s, { normalized: options.normalized }).scores);
+}
+
+/**
+ * The implementation {@link betweennessCentrality} delegates away from, kept as its
+ * differential-test oracle. Deleted at the removal release.
+ * @param graph - The input graph to analyze
+ * @param options - Algorithm configuration options
+ * @returns Centrality scores for each node keyed by node ID
+ * @internal
+ */
+export function legacyBetweennessCentrality(
+    graph: Graph,
+    options: BetweennessCentralityOptions = {},
 ): Record<string, number> {
     rejectIndexOptions(options, "betweennessCentrality");
     const nodes = Array.from(graph.nodes()).map((node) => node.id);
@@ -291,6 +319,28 @@ export function nodeBetweennessCentrality(
 export function edgeBetweennessCentrality(
     graph: Graph,
     options: BetweennessCentralityOptions = {},
+): Map<string, number> {
+    rejectIndexOptions(options, "edgeBetweennessCentrality");
+    // On an undirected graph the legacy Map adds each reversed "v-u" key in the order its searches
+    // first cross the edge that way, an order the port's per-edge scores do not carry.
+    if (!graph.isDirected || needsLegacyCode(graph)) {
+        return legacyEdgeBetweennessCentrality(graph, options);
+    }
+    const s = toSnapshot(graph);
+    return edgeScoresToPairMap(s, indexedEdgeBetweenness(s, { normalized: options.normalized }).scores);
+}
+
+/**
+ * The implementation {@link edgeBetweennessCentrality} delegates away from, kept as its
+ * differential-test oracle and for an undirected graph. Deleted at the removal release.
+ * @param graph - The input graph to analyze
+ * @param options - Algorithm configuration options
+ * @returns Edge centrality scores keyed by edge string representation
+ * @internal
+ */
+export function legacyEdgeBetweennessCentrality(
+    graph: Graph,
+    options: BetweennessCentralityOptions = {},
 ): Map<string, number> {
     rejectIndexOptions(options, "edgeBetweennessCentrality");
     const nodes = Array.from(graph.nodes()).map((node) => node.id);

package/src/algorithms/centrality/closeness.ts

@@ -1,4 +1,13 @@
+import type { GraphSnapshot } from "@graphty/graph-format";
+
 import type { Graph } from "../../core/graph.js";
+import {
+    closenessCentrality as indexedCloseness,
+    type ClosenessOptions,
+    nodeClosenessCentrality as indexedNodeCloseness,
+} from "../../indexed/closeness.js";
+import { exactArcWeights, scoresToRecord } from "../../indexed/facade.js";
+import { needsLegacyCode, toSnapshot } from "../../indexed/to-snapshot.js";
 import type { NodeId } from "../../types/index.js";
 import { bfsDistancesOnly, bfsWeightedDistances } from "../traversal/bfs-variants.js";
 
@@ -112,16 +121,56 @@ function calculateClosenessFromDistances(
  * Space Complexity: O(V)
  */
 export function closenessCentrality(graph: Graph, options: ClosenessCentralityOptions = {}): Record<string, number> {
-    const nodes = Array.from(graph.nodes()).map((node) => node.id);
-    const centrality: Record<string, number> = {};
-
-    for (const sourceNode of nodes) {
-        centrality[String(sourceNode)] = nodeClosenessCentrality(graph, sourceNode, options);
+    if (needsLegacyCode(graph)) {
+        return perNodeRecord(graph, (id) => legacyNodeClosenessCentrality(graph, id, options));
     }
+    const s = toSnapshot(graph);
+    return scoresToRecord(s.ids, indexedCloseness(s, portOptions(options)).scores);
+}
+
+/**
+ * The port's options for a legacy call; `optimized` picked a legacy search engine and has no
+ * counterpart.
+ * @param options - The legacy options
+ * @param s - Given only for a weighted call, which then reads this snapshot's exact f64 weights
+ * @returns The port's options
+ */
+function portOptions(options: ClosenessCentralityOptions, s?: GraphSnapshot): ClosenessOptions {
+    return {
+        normalized: options.normalized,
+        harmonic: options.harmonic,
+        cutoff: options.cutoff,
+        weighted: s !== undefined,
+        weights: s === undefined ? undefined : exactArcWeights(s),
+    };
+}
 
+/**
+ * The legacy whole-graph loop: one per-node score per node, keyed by `String(id)` in node order.
+ * @param graph - The input graph
+ * @param score - The per-node score
+ * @returns The keyed scores
+ */
+function perNodeRecord(graph: Graph, score: (id: NodeId) => number): Record<string, number> {
+    const centrality: Record<string, number> = {};
+    for (const node of graph.nodes()) {
+        centrality[String(node.id)] = score(node.id);
+    }
     return centrality;
 }
 
+/**
+ * Whether a weighted search must stay on the legacy code: with a negative weight the distance a
+ * node keeps depends on the order equal keys leave the priority queue, which the port does not
+ * reproduce.
+ * @param s - The snapshot
+ * @returns True when some weight is negative
+ */
+function hasNegativeWeight(s: GraphSnapshot): boolean {
+    const weights = exactArcWeights(s) ?? s.weights;
+    return weights?.some((w) => w < 0) ?? false;
+}
+
 /**
  * Calculate closeness centrality for a specific node
  * @param graph - The input graph to analyze
@@ -133,6 +182,30 @@ export function nodeClosenessCentrality(graph: Graph, node: NodeId, options: Clo
     if (!graph.hasNode(node)) {
         throw new Error(`Node ${String(node)} not found in graph`);
     }
+    if (needsLegacyCode(graph)) {
+        return legacyNodeClosenessCentrality(graph, node, options);
+    }
+    const s = toSnapshot(graph);
+    return indexedNodeCloseness(s, s.ids.indexOf(node), portOptions(options));
+}
+
+/**
+ * The implementation {@link nodeClosenessCentrality} delegates away from, kept as its
+ * differential-test oracle. Deleted at the removal release.
+ * @param graph - The input graph to analyze
+ * @param node - The node to calculate centrality for
+ * @param options - Algorithm configuration options
+ * @returns The closeness centrality score for the node
+ * @internal
+ */
+export function legacyNodeClosenessCentrality(
+    graph: Graph,
+    node: NodeId,
+    options: ClosenessCentralityOptions = {},
+): number {
+    if (!graph.hasNode(node)) {
+        throw new Error(`Node ${String(node)} not found in graph`);
+    }
 
     // Use optimized BFS variant for unweighted graphs
     const distances = bfsDistancesOnly(
@@ -156,14 +229,14 @@ export function weightedClosenessCentrality(
     graph: Graph,
     options: ClosenessCentralityOptions = {},
 ): Record<string, number> {
-    const nodes = Array.from(graph.nodes()).map((node) => node.id);
-    const centrality: Record<string, number> = {};
-
-    for (const sourceNode of nodes) {
-        centrality[String(sourceNode)] = nodeWeightedClosenessCentrality(graph, sourceNode, options);
+    if (needsLegacyCode(graph)) {
+        return perNodeRecord(graph, (id) => legacyNodeWeightedClosenessCentrality(graph, id, options));
     }
-
-    return centrality;
+    const s = toSnapshot(graph);
+    if (hasNegativeWeight(s)) {
+        return perNodeRecord(graph, (id) => legacyNodeWeightedClosenessCentrality(graph, id, options));
+    }
+    return scoresToRecord(s.ids, indexedCloseness(s, portOptions(options, s)).scores);
 }
 
 /**
@@ -181,6 +254,33 @@ export function nodeWeightedClosenessCentrality(
     if (!graph.hasNode(node)) {
         throw new Error(`Node ${String(node)} not found in graph`);
     }
+    if (needsLegacyCode(graph)) {
+        return legacyNodeWeightedClosenessCentrality(graph, node, options);
+    }
+    const s = toSnapshot(graph);
+    if (hasNegativeWeight(s)) {
+        return legacyNodeWeightedClosenessCentrality(graph, node, options);
+    }
+    return indexedNodeCloseness(s, s.ids.indexOf(node), portOptions(options, s));
+}
+
+/**
+ * The implementation {@link nodeWeightedClosenessCentrality} delegates away from, kept as its
+ * differential-test oracle and for a graph with a negative weight. Deleted at the removal release.
+ * @param graph - The input graph to analyze
+ * @param node - The node to calculate centrality for
+ * @param options - Algorithm configuration options
+ * @returns The weighted closeness centrality score for the node
+ * @internal
+ */
+export function legacyNodeWeightedClosenessCentrality(
+    graph: Graph,
+    node: NodeId,
+    options: ClosenessCentralityOptions = {},
+): number {
+    if (!graph.hasNode(node)) {
+        throw new Error(`Node ${String(node)} not found in graph`);
+    }
 
     // Use optimized weighted BFS variant (simplified Dijkstra)
     const distances = bfsWeightedDistances(