@graphty/algorithms 2.1.2 → 2.2.0

package/dist/src/clustering/hierarchical.js

@@ -1,328 +1,34 @@
 /**
  * Hierarchical Clustering Algorithm
  *
- * Builds a hierarchy of clusters through agglomeration (bottom-up)
- * or division (top-down). Useful for understanding multi-scale
- * structure in graphs.
+ * Builds a hierarchy of clusters through agglomeration (bottom-up). `hierarchicalClustering`
+ * delegates to `indexed.hierarchicalClustering` over an unweighted snapshot of the graph (hop
+ * distances never read a weight) and rebuilds the legacy dendrogram from its merges; the result
+ * equals the pre-migration implementation in `hierarchical-legacy.ts` exactly.
  */
+import { hierarchicalClustering as indexedHierarchicalClustering } from "../indexed/hierarchical.js";
+import { toTopologySnapshot } from "../indexed/to-snapshot.js";
+import { cutDendrogram, hierarchicalClustering as legacyHierarchicalClustering, } from "./hierarchical-legacy.js";
+export { cutDendrogram, cutDendrogramKClusters, modularityHierarchicalClustering } from "./hierarchical-legacy.js";
+const LINKAGES = ["single", "complete", "average", "ward"];
 /**
- * Convert Graph to adjacency set representation for clustering
- * @param graph - The input graph to convert
- * @returns Map of node IDs to sets of neighbor node IDs
- */
-function graphToAdjacencySet(graph) {
-    const adjacency = new Map();
-    // Initialize all nodes
-    for (const node of graph.nodes()) {
-        adjacency.set(String(node.id), new Set());
-    }
-    // Add edges
-    for (const edge of graph.edges()) {
-        const source = String(edge.source);
-        const target = String(edge.target);
-        const sourceSet = adjacency.get(source);
-        if (sourceSet) {
-            sourceSet.add(target);
-        }
-        // For undirected graphs, add reverse edge
-        if (!graph.isDirected) {
-            const targetSet = adjacency.get(target);
-            if (targetSet) {
-                targetSet.add(source);
-            }
-        }
-    }
-    return adjacency;
-}
-/**
- * Compute distance between two nodes based on graph structure
- * @param graph - Adjacency map representation of the graph
- * @param distances - Map to store computed distances between nodes
- */
-function computeGraphDistance(graph, distances) {
-    // Use BFS to compute shortest path distances
-    for (const start of graph.keys()) {
-        const dist = new Map();
-        const queue = [start];
-        dist.set(start, 0);
-        while (queue.length > 0) {
-            const node = queue.shift();
-            if (!node) {
-                continue;
-            }
-            const neighbors = graph.get(node);
-            if (neighbors) {
-                for (const neighbor of neighbors) {
-                    if (!dist.has(neighbor)) {
-                        dist.set(neighbor, (dist.get(node) ?? 0) + 1);
-                        queue.push(neighbor);
-                    }
-                }
-            }
-        }
-        distances.set(start, dist);
-    }
-}
-/**
- * Compute distance between two clusters based on linkage method
- * @param cluster1 - First cluster node
- * @param cluster2 - Second cluster node
- * @param distances - Precomputed distance matrix between nodes
- * @param linkage - Linkage method to use for computing cluster distance
- * @returns The distance between the two clusters
- */
-function clusterDistance(cluster1, cluster2, distances, linkage) {
-    const allDistances = [];
-    for (const node1 of cluster1.members) {
-        const node1Distances = distances.get(node1);
-        if (!node1Distances) {
-            continue;
-        }
-        for (const node2 of cluster2.members) {
-            const dist = node1Distances.get(node2);
-            if (dist !== undefined) {
-                allDistances.push(dist);
-            }
-        }
-    }
-    if (allDistances.length === 0) {
-        return Infinity;
-    }
-    switch (linkage) {
-        case "single":
-            return Math.min(...allDistances);
-        case "complete":
-            return Math.max(...allDistances);
-        case "average":
-            return allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
-        case "ward": {
-            // Simplified Ward's method - minimize within-cluster variance
-            const size1 = cluster1.members.size;
-            const size2 = cluster2.members.size;
-            const avgDist = allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
-            return avgDist * ((size1 * size2) / (size1 + size2));
-        }
-        default:
-            return Math.min(...allDistances);
-    }
-}
-/**
- * Internal implementation of agglomerative hierarchical clustering
- * @param graph - Adjacency map representation of the graph
- * @param linkage - Linkage method for cluster distance computation
- * @returns Hierarchical clustering result with dendrogram and cluster assignments
- */
-function hierarchicalClusteringImpl(graph, linkage = "single") {
-    const nodes = Array.from(graph.keys());
-    const n = nodes.length;
-    if (n === 0) {
-        return {
-            root: { id: "empty", members: new Set(), distance: 0, height: 0 },
-            dendrogram: [],
-            clusters: new Map(),
-        };
-    }
-    // Compute pairwise distances
-    const distances = new Map();
-    computeGraphDistance(graph, distances);
-    // Initialize clusters - each node is its own cluster
-    const clusters = nodes.map((node, i) => ({
-        id: `leaf-${String(i)}`,
-        members: new Set([node]),
-        distance: 0,
-        height: 0,
-    }));
-    const dendrogram = [...clusters];
-    let clusterCount = n;
-    // Distance matrix between clusters
-    const clusterDistances = new Map();
-    // Initialize cluster distances
-    for (let i = 0; i < clusters.length; i++) {
-        const cluster1 = clusters[i];
-        if (!cluster1) {
-            continue;
-        }
-        const distMap = new Map();
-        for (let j = i + 1; j < clusters.length; j++) {
-            const cluster2 = clusters[j];
-            if (!cluster2) {
-                continue;
-            }
-            const dist = clusterDistance(cluster1, cluster2, distances, linkage);
-            distMap.set(cluster2.id, dist);
-        }
-        clusterDistances.set(cluster1.id, distMap);
-    }
-    // Active clusters
-    const activeClusters = new Set(clusters);
-    // Merge clusters until only one remains
-    while (activeClusters.size > 1) {
-        // Find closest pair of clusters
-        let minDist = Infinity;
-        let mergeCluster1 = null;
-        let mergeCluster2 = null;
-        for (const cluster1 of activeClusters) {
-            const distMap = clusterDistances.get(cluster1.id);
-            if (!distMap) {
-                continue;
-            }
-            for (const cluster2 of activeClusters) {
-                if (cluster1.id >= cluster2.id) {
-                    continue;
-                }
-                const dist = distMap.get(cluster2.id) ?? clusterDistances.get(cluster2.id)?.get(cluster1.id) ?? Infinity;
-                if (dist < minDist) {
-                    minDist = dist;
-                    mergeCluster1 = cluster1;
-                    mergeCluster2 = cluster2;
-                }
-            }
-        }
-        if (!mergeCluster1 || !mergeCluster2 || minDist === Infinity) {
-            // No valid merge found - create forest
-            const trees = Array.from(activeClusters);
-            const forestRoot = {
-                id: `forest-${String(clusterCount++)}`,
-                members: new Set(nodes),
-                distance: Infinity,
-                height: Math.max(...trees.map((t) => t.height)) + 1,
-                trees,
-            };
-            dendrogram.push(forestRoot);
-            activeClusters.clear();
-            activeClusters.add(forestRoot);
-            break;
-        }
-        // Create new cluster
-        const newCluster = {
-            id: `cluster-${String(clusterCount++)}`,
-            members: new Set([...mergeCluster1.members, ...mergeCluster2.members]),
-            left: mergeCluster1,
-            right: mergeCluster2,
-            distance: minDist,
-            height: Math.max(mergeCluster1.height, mergeCluster2.height) + 1,
-        };
-        dendrogram.push(newCluster);
-        // Update distances to new cluster
-        const newDistMap = new Map();
-        for (const cluster of activeClusters) {
-            if (cluster.id === mergeCluster1.id || cluster.id === mergeCluster2.id) {
-                continue;
-            }
-            const dist = clusterDistance(newCluster, cluster, distances, linkage);
-            newDistMap.set(cluster.id, dist);
-            // Update reverse direction
-            const clusterDistMap = clusterDistances.get(cluster.id);
-            if (clusterDistMap) {
-                clusterDistMap.set(newCluster.id, dist);
-            }
-        }
-        clusterDistances.set(newCluster.id, newDistMap);
-        // Remove merged clusters
-        activeClusters.delete(mergeCluster1);
-        activeClusters.delete(mergeCluster2);
-        clusterDistances.delete(mergeCluster1.id);
-        clusterDistances.delete(mergeCluster2.id);
-        // Clean up references
-        for (const distMap of clusterDistances.values()) {
-            distMap.delete(mergeCluster1.id);
-            distMap.delete(mergeCluster2.id);
-        }
-        activeClusters.add(newCluster);
-    }
-    // Root is the last remaining cluster
-    const root = activeClusters.size > 0 ? Array.from(activeClusters)[0] : dendrogram[dendrogram.length - 1];
-    // Generate clusters at different heights
-    const clustersByLevel = new Map();
-    if (!root) {
-        return {
-            root: { id: "empty", members: new Set(), distance: 0, height: 0 },
-            dendrogram: [],
-            clusters: new Map(),
-        };
-    }
-    for (let h = 0; h <= root.height; h++) {
-        clustersByLevel.set(h, cutDendrogram(root, h));
-    }
-    return {
-        root,
-        dendrogram,
-        clusters: clustersByLevel,
-    };
-}
-/**
- * Cut dendrogram at specific height to get clusters
- * @param root - Root node of the dendrogram
- * @param height - Height at which to cut the dendrogram
- * @returns Array of sets representing clusters at the specified height
- */
-export function cutDendrogram(root, height) {
-    const clusters = [];
-    function traverse(node) {
-        if (node.height <= height || (!node.left && !node.right)) {
-            clusters.push(node.members);
-        }
-        else {
-            if (node.trees) {
-                // Handle forest nodes
-                for (const tree of node.trees) {
-                    traverse(tree);
-                }
-            }
-            else {
-                if (node.left) {
-                    traverse(node.left);
-                }
-                if (node.right) {
-                    traverse(node.right);
-                }
-            }
-        }
-    }
-    traverse(root);
-    return clusters;
-}
-/**
- * Cut dendrogram to get exactly k clusters
- * @param root - Root node of the dendrogram
- * @param k - Target number of clusters
- * @returns Array of sets representing exactly k clusters
+ * Agglomerative hierarchical clustering
+ * Builds clusters bottom-up by merging closest pairs
+ * @param graph - Undirected graph - accepts Graph class or Map<T, Set<T>>
+ * @param linkage - Linkage method for cluster distance
+ * @returns Hierarchical clustering result
+ *
+ * Time Complexity: O(n³) naive, O(n² log n) with heap
+ * Space Complexity: O(n²)
  */
-export function cutDendrogramKClusters(root, k) {
-    if (k <= 0) {
-        return [];
-    }
-    if (k === 1) {
-        return [root.members];
-    }
-    // Binary search for the right height
-    let low = 0;
-    let high = root.height;
-    while (low < high) {
-        const mid = Math.floor((low + high) / 2);
-        const clusters = cutDendrogram(root, mid);
-        if (clusters.length === k) {
-            return clusters;
-        }
-        else if (clusters.length < k) {
-            high = mid;
-        }
-        else {
-            low = mid + 1;
-        }
+export function hierarchicalClustering(graph, linkage = "single") {
+    const s = toTopologySnapshot(graph);
+    const n = s.nodeCount;
+    const names = Array.from({ length: n }, (_, i) => String(s.ids.idOf(i)));
+    // The old code keys nodes by String(id), so ids spelled alike (1 and "1") are one node to it.
+    if (new Set(names).size !== n) {
+        return legacyHierarchicalClustering(graph, linkage);
     }
-    return cutDendrogram(root, low);
-}
-/**
- * Compute modularity-based hierarchical clustering
- * Uses modularity gain to decide merges
- * @param graph - The input graph to cluster
- * @returns Hierarchical clustering result with dendrogram and cluster assignments
- */
-export function modularityHierarchicalClustering(graph) {
-    const adjacencySet = graphToAdjacencySet(graph);
-    const nodes = Array.from(adjacencySet.keys());
-    const n = nodes.length;
     if (n === 0) {
         return {
             root: { id: "empty", members: new Set(), distance: 0, height: 0 },
@@ -330,112 +36,45 @@ export function modularityHierarchicalClustering(graph) {
             clusters: new Map(),
         };
     }
-    // Compute degrees
-    const degrees = new Map();
-    let totalEdges = 0;
-    for (const [node, neighbors] of adjacencySet) {
-        degrees.set(node, neighbors.size);
-        totalEdges += neighbors.size;
-    }
-    // For undirected graphs
-    totalEdges = totalEdges / 2;
-    // Initialize clusters
-    const clusters = nodes.map((node, i) => ({
+    // An unknown linkage falls through to single linkage, as it always has.
+    const r = indexedHierarchicalClustering(s, { linkage: LINKAGES.includes(linkage) ? linkage : "single" });
+    const dendrogram = names.map((name, i) => ({
         id: `leaf-${String(i)}`,
-        members: new Set([node]),
+        members: new Set([name]),
         distance: 0,
         height: 0,
     }));
-    const dendrogram = [...clusters];
-    let clusterCount = n;
-    // Active clusters
-    const activeClusters = new Set(clusters);
-    // Community assignments
-    const communities = new Map();
-    nodes.forEach((node, i) => communities.set(node, i));
-    // Merge clusters based on modularity gain
-    while (activeClusters.size > 1) {
-        let maxGain = -Infinity;
-        let mergeCluster1 = null;
-        let mergeCluster2 = null;
-        for (const cluster1 of activeClusters) {
-            for (const cluster2 of activeClusters) {
-                if (cluster1.id >= cluster2.id) {
-                    continue;
-                }
-                // Calculate modularity gain
-                let edgesBetween = 0;
-                let degreeProduct = 0;
-                for (const node1 of cluster1.members) {
-                    const neighbors = adjacencySet.get(node1);
-                    const degree1 = degrees.get(node1) ?? 0;
-                    for (const node2 of cluster2.members) {
-                        if (neighbors?.has(node2)) {
-                            edgesBetween++;
-                        }
-                        const degree2 = degrees.get(node2) ?? 0;
-                        degreeProduct += degree1 * degree2;
-                    }
-                }
-                const gain = edgesBetween / totalEdges - degreeProduct / (4 * totalEdges * totalEdges);
-                if (gain > maxGain) {
-                    maxGain = gain;
-                    mergeCluster1 = cluster1;
-                    mergeCluster2 = cluster2;
-                }
-            }
-        }
-        if (!mergeCluster1 || !mergeCluster2) {
-            break;
-        }
-        // Create new cluster
-        const newCluster = {
-            id: `cluster-${String(clusterCount++)}`,
-            members: new Set([...mergeCluster1.members, ...mergeCluster2.members]),
-            left: mergeCluster1,
-            right: mergeCluster2,
-            distance: -maxGain, // Use negative gain as distance
-            height: Math.max(mergeCluster1.height, mergeCluster2.height) + 1,
-        };
-        dendrogram.push(newCluster);
-        // Remove old and add new
-        activeClusters.delete(mergeCluster1);
-        activeClusters.delete(mergeCluster2);
-        activeClusters.add(newCluster);
-    }
-    // Root is the last remaining cluster
-    const root = Array.from(activeClusters)[0] ?? dendrogram[dendrogram.length - 1];
-    // Generate clusters at different heights
-    const clustersByLevel = new Map();
-    if (!root) {
-        return {
-            root: { id: "empty", members: new Set(), distance: 0, height: 0 },
-            dendrogram: [],
-            clusters: new Map(),
+    for (let k = 0; k < r.left.length; k++) {
+        const left = dendrogram[r.left[k]];
+        const right = dendrogram[r.right[k]];
+        dendrogram.push({
+            id: `cluster-${String(n + k)}`,
+            members: new Set([...left.members, ...right.members]),
+            left,
+            right,
+            distance: r.distance[k],
+            height: r.height[n + k],
+        });
+    }
+    let root;
+    if (r.roots.length === 1) {
+        root = dendrogram[r.roots[0]];
+    }
+    else {
+        const trees = Array.from(r.roots, (c) => dendrogram[c]);
+        root = {
+            id: `forest-${String(dendrogram.length)}`,
+            members: new Set(names),
+            distance: Infinity,
+            height: Math.max(...trees.map((t) => t.height)) + 1,
+            trees,
         };
+        dendrogram.push(root);
     }
+    const clusters = new Map();
     for (let h = 0; h <= root.height; h++) {
-        clustersByLevel.set(h, cutDendrogram(root, h));
+        clusters.set(h, cutDendrogram(root, h));
     }
-    return {
-        root,
-        dendrogram,
-        clusters: clustersByLevel,
-    };
-}
-/**
- * Agglomerative hierarchical clustering
- * Builds clusters bottom-up by merging closest pairs
- * @param graph - Undirected graph - accepts Graph class or Map<T, Set<T>>
- * @param linkage - Linkage method for cluster distance
- * @returns Hierarchical clustering result
- *
- * Time Complexity: O(n³) naive, O(n² log n) with heap
- * Space Complexity: O(n²)
- */
-export function hierarchicalClustering(graph, linkage = "single") {
-    // Convert Graph to adjacency set representation
-    const adjacencySet = graphToAdjacencySet(graph);
-    return hierarchicalClusteringImpl(adjacencySet, linkage);
+    return { root, dendrogram, clusters };
 }
 //# sourceMappingURL=hierarchical.js.map

package/dist/src/clustering/hierarchical.js.map

@@ -1 +1 @@
-{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,KAAY;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEjD,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,YAAY;IACZ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,SAAS,EAAE,CAAC;YACZ,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;QAED,0CAA0C;QAC1C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,SAAS,EAAE,CAAC;gBACZ,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAqBD;;;;GAIG;AACH,SAAS,oBAAoB,CAAI,KAAqB,EAAE,SAAiC;IACrF,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;QAClC,MAAM,KAAK,GAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACR,SAAS;YACb,CAAC;YAED,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElC,IAAI,SAAS,EAAE,CAAC;gBACZ,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACtB,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CACpB,QAAwB,EACxB,QAAwB,EACxB,SAAiC,EACjC,OAAsB;IAEtB,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnC,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,EAAE,CAAC;YAClB,SAAS;QACb,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACrB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,QAAQ,OAAO,EAAE,CAAC;QACd,KAAK,QAAQ;YACT,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;QACrC,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;QACrC,KAAK,SAAS;YACV,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzE,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,8DAA8D;YAC9D,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;YACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;YACpC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9E,OAAO,OAAO,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QACzD,CAAC;QACD;YACI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;IACzC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,0BAA0B,CAC/B,KAAqB,EACrB,UAAyB,QAAQ;IAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACjE,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAEvC,qDAAqD;IACrD,MAAM,QAAQ,GAAqB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvD,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAqB,CAAC,GAAG,QAAQ,CAAC,CAAC;IACnD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,mCAAmC;IACnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEhE,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,SAAS;QACb,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACZ,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,kBAAkB;IAClB,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEzC,wCAAwC;IACxC,OAAO,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,gCAAgC;QAChC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,aAAa,GAA0B,IAAI,CAAC;QAChD,IAAI,aAAa,GAA0B,IAAI,CAAC;QAEhD,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,SAAS;YACb,CAAC;YAED,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAC7B,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GACN,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;gBAEhG,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,aAAa,GAAG,QAAQ,CAAC;oBACzB,aAAa,GAAG,QAAQ,CAAC;gBAC7B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3D,uCAAuC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACzC,MAAM,UAAU,GAAmB;gBAC/B,EAAE,EAAE,UAAU,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;gBACtC,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC;gBACvB,QAAQ,EAAE,QAAQ;gBAClB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;gBACnD,KAAK;aACR,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,cAAc,CAAC,KAAK,EAAE,CAAC;YACvB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC/B,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;YACtE,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,aAAa;YACpB,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC;SACnE,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,kCAAkC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACnC,IAAI,OAAO,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,EAAE,CAAC;gBACrE,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACtE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAEjC,2BAA2B;YAC3B,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxD,IAAI,cAAc,EAAE,CAAC;gBACjB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC5C,CAAC;QACL,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAEhD,yBAAyB;QACzB,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC1C,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAE1C,sBAAsB;QACtB,KAAK,MAAM,OAAO,IAAI,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YACjC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACnC,CAAC;IAED,qCAAqC;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEzG,yCAAyC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEpD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACjE,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAI,IAAoB,EAAE,MAAc;IACjE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,SAAS,QAAQ,CAAC,IAAoB;QAClC,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,sBAAsB;gBACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACZ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,CAAC;gBAED,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAI,IAAoB,EAAE,CAAS;IACrE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,qCAAqC;IACrC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IAEvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC;QACpB,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC;QACf,CAAC;aAAM,CAAC;YACJ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACL,CAAC;IAED,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gCAAgC,CAAC,KAAY;IACzD,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACjE,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,kBAAkB;IAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,YAAY,EAAE,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAClC,UAAU,IAAI,SAAS,CAAC,IAAI,CAAC;IACjC,CAAC;IAED,wBAAwB;IACxB,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;IAE5B,sBAAsB;IACtB,MAAM,QAAQ,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5D,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAA0B,CAAC,GAAG,QAAQ,CAAC,CAAC;IACxD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,kBAAkB;IAClB,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEzC,wBAAwB;IACxB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAErD,0CAA0C;IAC1C,OAAO,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QACxB,IAAI,aAAa,GAA+B,IAAI,CAAC;QACrD,IAAI,aAAa,GAA+B,IAAI,CAAC;QAErD,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACpC,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAC7B,SAAS;gBACb,CAAC;gBAED,4BAA4B;gBAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,IAAI,aAAa,GAAG,CAAC,CAAC;gBAEtB,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAExC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;wBACnC,IAAI,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BACxB,YAAY,EAAE,CAAC;wBACnB,CAAC;wBAED,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBACxC,aAAa,IAAI,OAAO,GAAG,OAAO,CAAC;oBACvC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,YAAY,GAAG,UAAU,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,CAAC;gBAEvF,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,aAAa,GAAG,QAAQ,CAAC;oBACzB,aAAa,GAAG,QAAQ,CAAC;gBAC7B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;YACnC,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,UAAU,GAAwB;YACpC,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;YACtE,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,aAAa;YACpB,QAAQ,EAAE,CAAC,OAAO,EAAE,gCAAgC;YACpD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC;SACnE,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,yBAAyB;QACzB,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACnC,CAAC;IAED,qCAAqC;IACrC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEhF,yCAAyC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEzD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACjE,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CAClC,KAAY,EACZ,UAAyB,QAAQ;IAEjC,gDAAgD;IAChD,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAChD,OAAO,0BAA0B,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC"}
+{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,sBAAsB,IAAI,6BAA6B,EAAE,MAAM,4BAA4B,CAAC;AACrG,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAEH,aAAa,EACb,sBAAsB,IAAI,4BAA4B,GAGzD,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EAAE,aAAa,EAAE,sBAAsB,EAAE,gCAAgC,EAAE,MAAM,0BAA0B,CAAC;AAEnH,MAAM,QAAQ,GAAsB,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CAClC,KAAY,EACZ,UAAyB,QAAQ;IAEjC,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,8FAA8F;IAC9F,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,4BAA4B,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACjE,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IACD,wEAAwE;IACxE,MAAM,CAAC,GAAG,6BAA6B,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IAEzG,MAAM,UAAU,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9D,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,UAAU,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,WAAW,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;YAC9B,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI;YACJ,KAAK;YACL,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;SAC1B,CAAC,CAAC;IACP,CAAC;IACD,IAAI,IAAyB,CAAC;IAC9B,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;SAAM,CAAC;QACJ,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,GAAG;YACH,EAAE,EAAE,UAAU,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE;YACzC,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC;YACvB,QAAQ,EAAE,QAAQ;YAClB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;YACnD,KAAK;SACR,CAAC;QACF,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAC1C,CAAC"}

package/dist/src/clustering/k-core-legacy.d.ts

@@ -0,0 +1,30 @@
+/**
+ * The k-core decomposition as it was before `kCoreDecomposition` delegated to
+ * `indexed.kCoreDecomposition`, unchanged. The facade in `k-core.ts` still calls it for the graphs
+ * the port cannot answer the same way (a directed graph, a self-loop, a NaN weight, ids spelled alike), its facade
+ * test uses it as the oracle, and the other k-core functions read the graph through
+ * `graphToAdjacencySet`.
+ */
+import type { Graph } from "../core/graph.js";
+/**
+ * Convert Graph to adjacency set representation
+ * @param graph - The input graph to convert
+ * @returns Map of node IDs to sets of neighbor node IDs
+ */
+export declare function graphToAdjacencySet(graph: Graph): Map<string, Set<string>>;
+export interface KCoreResult<T> {
+    cores: Map<number, Set<T>>;
+    coreness: Map<T, number>;
+    maxCore: number;
+}
+/**
+ * K-Core decomposition algorithm
+ * Finds all k-cores in the graph and assigns coreness values to nodes
+ * @param graph - Undirected graph - accepts Graph class or Map<T, Set<T>>
+ * @returns K-core decomposition results
+ *
+ * Time Complexity: O(V + E)
+ * Space Complexity: O(V)
+ */
+export declare function kCoreDecomposition(graph: Graph): KCoreResult<string>;
+//# sourceMappingURL=k-core-legacy.d.ts.map

package/dist/src/clustering/k-core-legacy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"k-core-legacy.d.ts","sourceRoot":"","sources":["../../../src/clustering/k-core-legacy.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CA4B1E;AAED,MAAM,WAAW,WAAW,CAAC,CAAC;IAC1B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,QAAQ,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;CACnB;AAsKD;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAIpE"}