@graphty/algorithms 1.0.1 → 1.1.0

package/dist/src/clustering/hierarchical.js

@@ -0,0 +1,439 @@
+/**
+ * Hierarchical Clustering Algorithm
+ *
+ * Builds a hierarchy of clusters through agglomeration (bottom-up)
+ * or division (top-down). Useful for understanding multi-scale
+ * structure in graphs.
+ */
+/**
+ * Compute distance between two nodes based on graph structure
+ */
+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)) {
+                        const nodeDistance = dist.get(node);
+                        if (nodeDistance !== undefined) {
+                            dist.set(neighbor, nodeDistance + 1);
+                        }
+                        queue.push(neighbor);
+                    }
+                }
+            }
+        }
+        distances.set(start, dist);
+    }
+}
+/**
+ * Compute distance between clusters based on linkage method
+ */
+function clusterDistance(cluster1, cluster2, distances, method) {
+    if (cluster1.size === 0 || cluster2.size === 0) {
+        return Infinity;
+    }
+    const allDistances = [];
+    for (const node1 of cluster1) {
+        for (const node2 of cluster2) {
+            const dist = distances.get(node1)?.get(node2) ?? Infinity;
+            allDistances.push(dist);
+        }
+    }
+    switch (method) {
+        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":
+            // Ward's method minimizes within-cluster variance
+            // For simplicity, we use average here
+            return allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
+        default:
+            return Math.min(...allDistances);
+    }
+}
+/**
+ * Agglomerative hierarchical clustering
+ * Builds clusters bottom-up by merging closest pairs
+ *
+ * @param graph - Undirected graph
+ * @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") {
+    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 clusterI = clusters[i];
+        if (!clusterI) {
+            continue;
+        }
+        clusterDistances.set(clusterI.id, new Map());
+        for (let j = i + 1; j < clusters.length; j++) {
+            const clusterJ = clusters[j];
+            if (!clusterJ) {
+                continue;
+            }
+            const dist = clusterDistance(clusterI.members, clusterJ.members, distances, linkage);
+            const clusterIDistances = clusterDistances.get(clusterI.id);
+            if (clusterIDistances) {
+                clusterIDistances.set(clusterJ.id, dist);
+            }
+        }
+    }
+    // Merge clusters until only one remains
+    while (clusters.length > 1) {
+        // Find closest pair of clusters
+        let minDist = Infinity;
+        let merge1 = 0;
+        let merge2 = 0;
+        for (let i = 0; i < clusters.length; i++) {
+            for (let j = i + 1; j < clusters.length; j++) {
+                const clusterI = clusters[i];
+                const clusterJ = clusters[j];
+                if (!clusterI || !clusterJ) {
+                    continue;
+                }
+                const dist = clusterDistances.get(clusterI.id)?.get(clusterJ.id) ??
+                    clusterDistances.get(clusterJ.id)?.get(clusterI.id) ??
+                    Infinity;
+                if (dist < minDist) {
+                    minDist = dist;
+                    merge1 = i;
+                    merge2 = j;
+                }
+            }
+        }
+        // Check if we found a valid merge
+        if (minDist === Infinity || merge1 === merge2) {
+            // No more clusters can be merged (disconnected components)
+            break;
+        }
+        // Create new cluster
+        const cluster1 = clusters[merge1];
+        const cluster2 = clusters[merge2];
+        if (!cluster1 || !cluster2) {
+            continue;
+        }
+        const newCluster = {
+            id: `cluster-${String(clusterCount++)}`,
+            members: new Set([...cluster1.members, ...cluster2.members]),
+            left: cluster1,
+            right: cluster2,
+            distance: minDist,
+            height: Math.max(cluster1.height, cluster2.height) + 1,
+        };
+        dendrogram.push(newCluster);
+        // Update cluster distances for new cluster
+        clusterDistances.set(newCluster.id, new Map());
+        for (let i = 0; i < clusters.length; i++) {
+            if (i !== merge1 && i !== merge2) {
+                const clusterI = clusters[i];
+                if (!clusterI) {
+                    continue;
+                }
+                const newDist = clusterDistance(newCluster.members, clusterI.members, distances, linkage);
+                const newClusterDistances = clusterDistances.get(newCluster.id);
+                if (newClusterDistances) {
+                    newClusterDistances.set(clusterI.id, newDist);
+                }
+            }
+        }
+        // Remove old clusters and their distances
+        clusterDistances.delete(cluster1.id);
+        clusterDistances.delete(cluster2.id);
+        for (const [, dists] of clusterDistances) {
+            dists.delete(cluster1.id);
+            dists.delete(cluster2.id);
+        }
+        // Remove merged clusters and add new one
+        clusters.splice(Math.max(merge1, merge2), 1);
+        clusters.splice(Math.min(merge1, merge2), 1);
+        clusters.push(newCluster);
+    }
+    // Generate clusters at different levels
+    const clustersByLevel = new Map();
+    function extractClustersAtHeight(node, height, clusters) {
+        if (node.height <= height || !node.left || !node.right) {
+            clusters.push(node.members);
+        }
+        else {
+            extractClustersAtHeight(node.left, height, clusters);
+            extractClustersAtHeight(node.right, height, clusters);
+        }
+    }
+    // Handle the case where we have multiple disconnected components
+    let root;
+    if (clusters.length === 0) {
+        return {
+            root: { id: "empty", members: new Set(), distance: 0, height: 0 },
+            dendrogram: [],
+            clusters: new Map(),
+        };
+    }
+    else if (clusters.length === 1 && clusters[0]) {
+        root = clusters[0];
+    }
+    else {
+        // Create a root that combines all remaining clusters (forest)
+        const allMembers = new Set();
+        let maxHeight = 0;
+        for (const cluster of clusters) {
+            for (const member of cluster.members) {
+                allMembers.add(member);
+            }
+            maxHeight = Math.max(maxHeight, cluster.height);
+        }
+        root = {
+            id: "root-forest",
+            members: allMembers,
+            distance: Infinity,
+            height: maxHeight + 1,
+            // Store references to the individual trees
+            trees: [...clusters],
+        };
+        dendrogram.push(root);
+    }
+    for (let h = 0; h <= root.height; h++) {
+        const clustersAtHeight = [];
+        if (clusters.length > 1 && h === root.height) {
+            // At forest root height, return single cluster with all members
+            clustersAtHeight.push(root.members);
+        }
+        else if (clusters.length > 1 && h < root.height) {
+            // For forest, extract from each tree separately
+            for (const tree of clusters) {
+                extractClustersAtHeight(tree, h, clustersAtHeight);
+            }
+        }
+        else {
+            extractClustersAtHeight(root, h, clustersAtHeight);
+        }
+        clustersByLevel.set(h, clustersAtHeight);
+    }
+    return {
+        root,
+        dendrogram,
+        clusters: clustersByLevel,
+    };
+}
+/**
+ * Cut dendrogram at specified height to get clusters
+ */
+export function cutDendrogram(root, height) {
+    const clusters = [];
+    function traverse(node) {
+        // Handle forest root specially
+        if (node.trees) {
+            if (node.height <= height) {
+                // If we're at or below the requested height, return the whole forest as one cluster
+                clusters.push(node.members);
+            }
+            else {
+                // Otherwise, traverse each tree in the forest
+                for (const tree of node.trees) {
+                    traverse(tree);
+                }
+            }
+            return;
+        }
+        // Normal binary tree traversal
+        if (node.height <= height || !node.left || !node.right) {
+            clusters.push(node.members);
+        }
+        else {
+            traverse(node.left);
+            traverse(node.right);
+        }
+    }
+    traverse(root);
+    return clusters;
+}
+/**
+ * Cut dendrogram to get k clusters
+ */
+export function cutDendrogramKClusters(root, k) {
+    if (k <= 0) {
+        return [];
+    }
+    if (k === 1) {
+        return [root.members];
+    }
+    // Find the height that gives us k clusters
+    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;
+        }
+    }
+    return cutDendrogram(root, low);
+}
+/**
+ * Compute modularity-based hierarchical clustering
+ * Uses modularity gain to decide merges
+ */
+export function modularityHierarchicalClustering(graph) {
+    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(),
+        };
+    }
+    // Calculate total edges
+    let m = 0;
+    for (const neighbors of graph.values()) {
+        m += neighbors.size;
+    }
+    m = m / 2; // Each edge counted twice
+    // Initialize clusters
+    const clusters = nodes.map((node, i) => ({
+        id: `leaf-${String(i)}`,
+        members: new Set([node]),
+        distance: 0,
+        height: 0,
+    }));
+    const dendrogram = [...clusters];
+    let clusterCount = n;
+    // Track community assignments
+    const communityMap = new Map();
+    nodes.forEach((node, i) => communityMap.set(node, i));
+    // Compute modularity gain for merging communities
+    function modularityGain(comm1, comm2) {
+        let edgesBetween = 0;
+        let degree1 = 0;
+        let degree2 = 0;
+        for (const node1 of comm1) {
+            const neighbors = graph.get(node1);
+            if (!neighbors) {
+                continue;
+            }
+            degree1 += neighbors.size;
+            for (const neighbor of neighbors) {
+                if (comm2.has(neighbor)) {
+                    edgesBetween++;
+                }
+            }
+        }
+        for (const node2 of comm2) {
+            const node2Neighbors = graph.get(node2);
+            if (node2Neighbors) {
+                degree2 += node2Neighbors.size;
+            }
+        }
+        // Modularity gain formula
+        const gain = (edgesBetween / m) - ((degree1 * degree2) / (4 * m * m));
+        return gain;
+    }
+    // Merge clusters based on modularity
+    while (clusters.length > 1) {
+        let maxGain = -Infinity;
+        let merge1 = 0;
+        let merge2 = 0;
+        for (let i = 0; i < clusters.length; i++) {
+            for (let j = i + 1; j < clusters.length; j++) {
+                const clusterI = clusters[i];
+                const clusterJ = clusters[j];
+                if (!clusterI || !clusterJ) {
+                    continue;
+                }
+                const gain = modularityGain(clusterI.members, clusterJ.members);
+                if (gain > maxGain) {
+                    maxGain = gain;
+                    merge1 = i;
+                    merge2 = j;
+                }
+            }
+        }
+        // Create new cluster
+        const cluster1 = clusters[merge1];
+        const cluster2 = clusters[merge2];
+        if (!cluster1 || !cluster2) {
+            continue;
+        }
+        const newCluster = {
+            id: `cluster-${String(clusterCount++)}`,
+            members: new Set([...cluster1.members, ...cluster2.members]),
+            left: cluster1,
+            right: cluster2,
+            distance: -maxGain, // Use negative gain as distance
+            height: Math.max(cluster1.height, cluster2.height) + 1,
+        };
+        dendrogram.push(newCluster);
+        // Update community assignments
+        for (const node of newCluster.members) {
+            communityMap.set(node, clusterCount - 1);
+        }
+        // Remove merged clusters
+        clusters.splice(Math.max(merge1, merge2), 1);
+        clusters.splice(Math.min(merge1, merge2), 1);
+        clusters.push(newCluster);
+    }
+    // Generate clusters at different levels
+    const clustersByLevel = new Map();
+    const root = clusters[0];
+    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,
+    };
+}
+//# sourceMappingURL=hierarchical.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqBH;;GAEG;AACH,SAAS,oBAAoB,CACzB,KAAqB,EACrB,SAAiC;IAEjC,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,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACpC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;wBACzC,CAAC;wBAED,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;;GAEG;AACH,SAAS,eAAe,CACpB,QAAgB,EAChB,QAAgB,EAChB,SAAiC,EACjC,MAAqB;IAErB,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;YAC1D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,QAAQ,MAAM,EAAE,CAAC;QACb,KAAK,QAAQ;YACT,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,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;YACP,kDAAkD;YAClD,sCAAsC;YACtC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzE;YACI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;IAC1C,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAClC,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,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,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,GAAI,QAAQ,CAAC,CAAC;IACpD,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,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,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,CACxB,QAAQ,CAAC,OAAO,EAChB,QAAQ,CAAC,OAAO,EAChB,SAAS,EACT,OAAO,CACV,CAAC;YACF,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC5D,IAAI,iBAAiB,EAAE,CAAC;gBACpB,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC;IAED,wCAAwC;IACxC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,gCAAgC;QAC5B,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5D,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACnD,QAAQ,CAAC;gBAEb,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM,GAAG,CAAC,CAAC;oBACX,MAAM,GAAG,CAAC,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QAED,kCAAkC;QAClC,IAAI,OAAO,KAAK,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC5C,2DAA2D;YAC3D,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QAED,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,QAAQ,CAAC,OAAO,EAAE,GAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC9D,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC;SACzD,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,2CAA2C;QAC3C,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACZ,SAAS;gBACb,CAAC;gBAED,MAAM,OAAO,GAAG,eAAe,CAC3B,UAAU,CAAC,OAAO,EAClB,QAAQ,CAAC,OAAO,EAChB,SAAS,EACT,OAAO,CACV,CAAC;gBACF,MAAM,mBAAmB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChE,IAAI,mBAAmB,EAAE,CAAC;oBACtB,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAClD,CAAC;YACL,CAAC;QACL,CAAC;QAED,0CAA0C;QAC1C,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;YACvC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC1B,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,yCAAyC;QACzC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,wCAAwC;IACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEpD,SAAS,uBAAuB,CAAC,IAAoB,EAAE,MAAc,EAAE,QAAkB;QACrF,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,uBAAuB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACrD,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,iEAAiE;IACjE,IAAI,IAAoB,CAAC;IACzB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;SAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;SAAM,CAAC;QACJ,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAK,CAAC;QAChC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;YACD,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,GAAG;YACH,EAAE,EAAE,aAAa;YACjB,OAAO,EAAE,UAAU;YACnB,QAAQ,EAAE,QAAQ;YAClB,MAAM,EAAE,SAAS,GAAG,CAAC;YACrB,2CAA2C;YAC3C,KAAK,EAAE,CAAC,GAAI,QAAQ,CAAC;SACxB,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3C,gEAAgE;YAChE,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,gDAAgD;YAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,uBAAuB,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACvD,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,uBAAuB,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACvD,CAAC;QAED,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CACzB,IAAoB,EACpB,MAAc;IAEd,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,SAAS,QAAQ,CAAC,IAAoB;QAClC,+BAA+B;QAC/B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACxB,oFAAoF;gBACpF,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACJ,8CAA8C;gBAC9C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACL,CAAC;YAED,OAAO;QACX,CAAC;QAED,+BAA+B;QAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAClC,IAAoB,EACpB,CAAS;IAET,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,2CAA2C;IAC3C,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;;;GAGG;AACH,MAAM,UAAU,gCAAgC,CAC5C,KAAqB;IAErB,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,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,wBAAwB;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC;IACxB,CAAC;IACD,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,0BAA0B;IAErC,sBAAsB;IACtB,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,GAAI,QAAQ,CAAC,CAAC;IACpD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,8BAA8B;IAC9B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAEtD,kDAAkD;IAClD,SAAS,cAAc,CAAC,KAAa,EAAE,KAAa;QAChD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACb,SAAS;YACb,CAAC;YAED,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC;YAE1B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACtB,YAAY,EAAE,CAAC;gBACnB,CAAC;YACL,CAAC;QACL,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACjB,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC;YACnC,CAAC;QACL,CAAC;QAED,0BAA0B;QAC1B,MAAM,IAAI,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,qCAAqC;IACrC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAEhE,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM,GAAG,CAAC,CAAC;oBACX,MAAM,GAAG,CAAC,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QAED,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,QAAQ,CAAC,OAAO,EAAE,GAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC9D,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,CAAC,OAAO,EAAE,gCAAgC;YACpD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC;SACzD,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACpC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,yBAAyB;QACzB,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,wCAAwC;IACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,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"}

package/dist/src/clustering/index.d.ts

@@ -0,0 +1,7 @@
+export * from "./hierarchical.js";
+export * from "./k-core.js";
+export type { MCLOptions, MCLResult } from "./mcl.js";
+export { calculateMCLModularity, markovClustering } from "./mcl.js";
+export type { SpectralClusteringOptions, SpectralClusteringResult } from "./spectral.js";
+export { spectralClustering } from "./spectral.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/clustering/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/clustering/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAC;AAClC,cAAc,aAAa,CAAC;AAC5B,YAAY,EAAC,UAAU,EAAE,SAAS,EAAC,MAAM,UAAU,CAAC;AACpD,OAAO,EAAC,sBAAsB,EAAE,gBAAgB,EAAC,MAAM,UAAU,CAAC;AAClE,YAAY,EAAC,yBAAyB,EAAE,wBAAwB,EAAC,MAAM,eAAe,CAAC;AACvF,OAAO,EAAC,kBAAkB,EAAC,MAAM,eAAe,CAAC"}

package/dist/src/clustering/index.js

@@ -0,0 +1,5 @@
+export * from "./hierarchical.js";
+export * from "./k-core.js";
+export { calculateMCLModularity, markovClustering } from "./mcl.js";
+export { spectralClustering } from "./spectral.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/clustering/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAC;AAClC,cAAc,aAAa,CAAC;AAE5B,OAAO,EAAC,sBAAsB,EAAE,gBAAgB,EAAC,MAAM,UAAU,CAAC;AAElE,OAAO,EAAC,kBAAkB,EAAC,MAAM,eAAe,CAAC"}

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

@@ -0,0 +1,63 @@
+/**
+ * K-Core Decomposition Algorithm
+ *
+ * Finds the k-core subgraph where each node has at least k neighbors
+ * within the subgraph. Used for identifying cohesive groups and
+ * understanding graph structure.
+ */
+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 as adjacency list
+ * @returns K-core decomposition results
+ *
+ * Time Complexity: O(V + E)
+ * Space Complexity: O(V)
+ */
+export declare function kCoreDecomposition<T>(graph: Map<T, Set<T>>): KCoreResult<T>;
+/**
+ * Extract the k-core subgraph
+ * Returns nodes that belong to k-core or higher
+ *
+ * @param graph - Undirected graph
+ * @param k - Core number
+ * @returns Set of nodes in k-core or higher
+ */
+export declare function getKCore<T>(graph: Map<T, Set<T>>, k: number): Set<T>;
+/**
+ * Get the induced subgraph for k-core
+ * Returns the actual subgraph containing only k-core nodes
+ *
+ * @param graph - Original graph
+ * @param k - Core number
+ * @returns K-core subgraph
+ */
+export declare function getKCoreSubgraph<T>(graph: Map<T, Set<T>>, k: number): Map<T, Set<T>>;
+/**
+ * Degeneracy ordering of the graph
+ * Orders nodes by their coreness values
+ *
+ * @param graph - Undirected graph
+ * @returns Array of nodes ordered by degeneracy
+ */
+export declare function degeneracyOrdering<T>(graph: Map<T, Set<T>>): T[];
+/**
+ * Find k-truss subgraph (triangular k-cores)
+ * Each edge must be part of at least k-2 triangles
+ *
+ * @param graph - Undirected graph
+ * @param k - Truss number (k >= 2)
+ * @returns Edges in k-truss
+ */
+export declare function kTruss<T>(graph: Map<T, Set<T>>, k: number): Set<string>;
+/**
+ * Convert directed graph to undirected for k-core analysis
+ */
+export declare function toUndirected<T>(directedGraph: Map<T, Map<T, number>>): Map<T, Set<T>>;
+//# sourceMappingURL=k-core.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"k-core.d.ts","sourceRoot":"","sources":["../../../src/clustering/k-core.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,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;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAChC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GACtB,WAAW,CAAC,CAAC,CAAC,CA6JhB;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACtB,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EACrB,CAAC,EAAE,MAAM,GACV,GAAG,CAAC,CAAC,CAAC,CAWR;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAC9B,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EACrB,CAAC,EAAE,MAAM,GACV,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAkBhB;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAChC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GACtB,CAAC,EAAE,CA6CL;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EACpB,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EACrB,CAAC,EAAE,MAAM,GACV,GAAG,CAAC,MAAM,CAAC,CAoHb;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC1B,aAAa,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GACtC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CA4BhB"}