@graphty/algorithms 1.0.1 → 1.2.0

package/dist/src/clustering/k-core.js

@@ -0,0 +1,377 @@
+/**
+ * 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.
+ */
+/**
+ * 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 function kCoreDecomposition(graph) {
+    if (graph.size === 0) {
+        return { cores: new Map(), coreness: new Map(), maxCore: 0 };
+    }
+    const n = graph.size;
+    const nodes = Array.from(graph.keys());
+    const nodeToIndex = new Map();
+    nodes.forEach((node, i) => nodeToIndex.set(node, i));
+    // Initialize data structures
+    const degree = new Array(n).fill(0);
+    const pos = new Array(n).fill(0);
+    const vert = new Array(n).fill(0);
+    const coreness = new Map();
+    // Initialize coreness for all nodes to 0
+    for (let i = 0; i < n; i++) {
+        const node = nodes[i];
+        if (node !== undefined) {
+            coreness.set(node, 0);
+        }
+    }
+    // Compute initial degrees
+    let maxDegree = 0;
+    for (let i = 0; i < n; i++) {
+        const node = nodes[i];
+        if (!node) {
+            continue;
+        }
+        const neighbors = graph.get(node);
+        const nodeSize = neighbors ? neighbors.size : 0;
+        degree[i] = nodeSize;
+        maxDegree = Math.max(maxDegree, nodeSize);
+    }
+    // Count nodes of each degree
+    const bin = new Array(maxDegree + 1).fill(0);
+    for (let i = 0; i < n; i++) {
+        const deg = degree[i];
+        if (deg !== undefined && deg >= 0 && deg < bin.length) {
+            const currentCount = bin[deg];
+            if (currentCount !== undefined) {
+                bin[deg] = currentCount + 1;
+            }
+        }
+    }
+    // Starting position of each degree in sorted array
+    let start = 0;
+    for (let d = 0; d <= maxDegree; d++) {
+        const temp = bin[d] ?? 0;
+        bin[d] = start;
+        start += temp;
+    }
+    // Sort nodes by degree
+    for (let i = 0; i < n; i++) {
+        const deg = degree[i];
+        if (deg !== undefined && deg >= 0 && deg < bin.length) {
+            const posIndex = bin[deg] ?? 0;
+            pos[i] = posIndex;
+            vert[posIndex] = i;
+            const currentBin = bin[deg];
+            if (currentBin !== undefined) {
+                bin[deg] = currentBin + 1;
+            }
+        }
+        else {
+            // If we can't properly place the node in vert, set its position to -1
+            // This shouldn't happen with our fixes, but just in case
+            pos[i] = -1;
+        }
+    }
+    // Recover starting positions
+    for (let d = maxDegree; d > 0; d--) {
+        bin[d] = bin[d - 1] ?? 0;
+    }
+    bin[0] = 0;
+    // Main algorithm
+    for (let i = 0; i < n; i++) {
+        const v = vert[i];
+        if (v === undefined) {
+            continue;
+        }
+        const node = nodes[v];
+        if (node === undefined) {
+            continue;
+        }
+        const degreeV = degree[v];
+        if (degreeV !== undefined) {
+            coreness.set(node, degreeV);
+        }
+        // Process neighbors
+        const neighbors = graph.get(node);
+        if (!neighbors) {
+            // Node has no neighbors, skip neighbor processing but coreness is already set
+            continue;
+        }
+        for (const neighbor of neighbors) {
+            const u = nodeToIndex.get(neighbor);
+            if (u === undefined) {
+                continue;
+            }
+            const degreeU = degree[u];
+            const degreeV = degree[v];
+            if (degreeU !== undefined && degreeV !== undefined && degreeU > degreeV) {
+                const du = degreeU;
+                const pu = pos[u];
+                const pw = bin[du] ?? 0;
+                const w = vert[pw];
+                if (u !== w && w !== undefined && pw < n && pu !== undefined) {
+                    // Swap u and w in the sorted order
+                    vert[pu] = w;
+                    vert[pw] = u;
+                    pos[u] = pw;
+                    pos[w] = pu;
+                }
+                const currentBin = bin[du];
+                if (currentBin !== undefined) {
+                    bin[du] = currentBin + 1;
+                }
+                degree[u] = degreeU - 1;
+            }
+        }
+    }
+    // Build cores map
+    const cores = new Map();
+    let maxCore = 0;
+    for (const [node, core] of coreness) {
+        if (!cores.has(core)) {
+            cores.set(core, new Set());
+        }
+        const coreSet = cores.get(core);
+        if (coreSet) {
+            coreSet.add(node);
+        }
+        maxCore = Math.max(maxCore, core);
+    }
+    return { cores, coreness, maxCore };
+}
+/**
+ * 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 function getKCore(graph, k) {
+    const { coreness } = kCoreDecomposition(graph);
+    const kCore = new Set();
+    for (const [node, core] of coreness) {
+        if (core >= k) {
+            kCore.add(node);
+        }
+    }
+    return kCore;
+}
+/**
+ * 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 function getKCoreSubgraph(graph, k) {
+    const kCoreNodes = getKCore(graph, k);
+    const subgraph = new Map();
+    for (const node of kCoreNodes) {
+        const neighbors = graph.get(node);
+        if (neighbors) {
+            const coreNeighbors = new Set();
+            for (const neighbor of neighbors) {
+                if (kCoreNodes.has(neighbor)) {
+                    coreNeighbors.add(neighbor);
+                }
+            }
+            subgraph.set(node, coreNeighbors);
+        }
+    }
+    return subgraph;
+}
+/**
+ * Degeneracy ordering of the graph
+ * Orders nodes by their coreness values
+ *
+ * @param graph - Undirected graph
+ * @returns Array of nodes ordered by degeneracy
+ */
+export function degeneracyOrdering(graph) {
+    const degree = new Map();
+    const remaining = new Map();
+    const ordering = [];
+    // Initialize
+    for (const [node, neighbors] of graph) {
+        degree.set(node, neighbors.size);
+        remaining.set(node, new Set(neighbors));
+    }
+    // Build ordering
+    while (ordering.length < graph.size) {
+        // Find minimum degree node
+        let minDegree = Infinity;
+        let minNode;
+        for (const [node, deg] of degree) {
+            if (!ordering.includes(node) && deg < minDegree) {
+                minDegree = deg;
+                minNode = node;
+            }
+        }
+        if (minNode === undefined) {
+            break;
+        }
+        ordering.push(minNode);
+        // Update neighbors
+        const neighbors = remaining.get(minNode);
+        if (neighbors) {
+            for (const neighbor of neighbors) {
+                const neighborDegree = degree.get(neighbor);
+                if (neighborDegree !== undefined) {
+                    degree.set(neighbor, neighborDegree - 1);
+                }
+                remaining.get(neighbor)?.delete(minNode);
+            }
+        }
+    }
+    return ordering;
+}
+/**
+ * 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 function kTruss(graph, k) {
+    if (k < 2) {
+        throw new Error("k must be at least 2 for k-truss");
+    }
+    // Count triangles for each edge
+    const edgeTriangles = new Map();
+    const edges = new Set();
+    // Initialize edges
+    for (const [u, neighbors] of graph) {
+        for (const v of neighbors) {
+            if (u < v) { // Avoid duplicates
+                const edge = `${String(u)},${String(v)}`;
+                edges.add(edge);
+                edgeTriangles.set(edge, 0);
+            }
+        }
+    }
+    // Count triangles
+    for (const [u, uNeighbors] of graph) {
+        for (const v of uNeighbors) {
+            if (u < v) {
+                const vNeighbors = graph.get(v);
+                if (vNeighbors) {
+                    // Find common neighbors (triangles)
+                    for (const w of uNeighbors) {
+                        if (v < w && vNeighbors.has(w)) {
+                            // Triangle found: u-v-w
+                            const edge1 = `${String(u)},${String(v)}`;
+                            const edge2 = `${String(u)},${String(w)}`;
+                            const edge3 = `${String(v)},${String(w)}`;
+                            const edge1Count = edgeTriangles.get(edge1);
+                            const edge2Count = edgeTriangles.get(edge2);
+                            const edge3Count = edgeTriangles.get(edge3);
+                            if (edge1Count !== undefined) {
+                                edgeTriangles.set(edge1, edge1Count + 1);
+                            }
+                            if (edge2Count !== undefined) {
+                                edgeTriangles.set(edge2, edge2Count + 1);
+                            }
+                            if (edge3Count !== undefined) {
+                                edgeTriangles.set(edge3, edge3Count + 1);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    // Remove edges with insufficient triangles
+    const kTrussEdges = new Set(edges);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        const toRemove = new Set();
+        for (const edge of kTrussEdges) {
+            const triangleCount = edgeTriangles.get(edge);
+            if (triangleCount !== undefined && triangleCount < k - 2) {
+                toRemove.add(edge);
+                changed = true;
+            }
+        }
+        // Remove edges and update triangle counts
+        for (const edge of toRemove) {
+            kTrussEdges.delete(edge);
+            const parts = edge.split(",");
+            if (parts.length < 2) {
+                continue;
+            }
+            const [u, v] = parts;
+            if (!u || !v) {
+                continue;
+            }
+            // Update triangle counts for affected edges
+            const uNode = u;
+            const vNode = v;
+            const uNeighbors = graph.get(uNode);
+            const vNeighbors = graph.get(vNode);
+            if (uNeighbors && vNeighbors) {
+                for (const w of uNeighbors) {
+                    if (vNeighbors.has(w)) {
+                        const edge1 = uNode < w ? `${String(uNode)},${String(w)}` : `${String(w)},${String(uNode)}`;
+                        const edge2 = vNode < w ? `${String(vNode)},${String(w)}` : `${String(w)},${String(vNode)}`;
+                        if (kTrussEdges.has(edge1)) {
+                            const edge1Count = edgeTriangles.get(edge1);
+                            if (edge1Count !== undefined) {
+                                edgeTriangles.set(edge1, edge1Count - 1);
+                            }
+                        }
+                        if (kTrussEdges.has(edge2)) {
+                            const edge2Count = edgeTriangles.get(edge2);
+                            if (edge2Count !== undefined) {
+                                edgeTriangles.set(edge2, edge2Count - 1);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    return kTrussEdges;
+}
+/**
+ * Convert directed graph to undirected for k-core analysis
+ */
+export function toUndirected(directedGraph) {
+    const undirected = new Map();
+    // Initialize all nodes
+    for (const node of directedGraph.keys()) {
+        undirected.set(node, new Set());
+    }
+    // Add edges in both directions
+    for (const [u, neighbors] of directedGraph) {
+        for (const v of neighbors.keys()) {
+            const uNeighbors = undirected.get(u);
+            if (uNeighbors) {
+                uNeighbors.add(v);
+            }
+            if (!undirected.has(v)) {
+                undirected.set(v, new Set());
+            }
+            const vNeighbors = undirected.get(v);
+            if (vNeighbors) {
+                vNeighbors.add(u);
+            }
+        }
+    }
+    return undirected;
+}
+//# sourceMappingURL=k-core.js.map

package/dist/src/clustering/k-core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"k-core.js","sourceRoot":"","sources":["../../../src/clustering/k-core.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAAqB;IAErB,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,EAAC,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAa,CAAC;IACzC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAErD,6BAA6B;IAC7B,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAa,CAAC;IAEtC,yCAAyC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;IAED,0BAA0B;IAC1B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,SAAS;QACb,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACrB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED,6BAA6B;IAC7B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YACpD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;IACL,CAAC;IAED,mDAAmD;IACnD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACf,KAAK,IAAI,IAAI,CAAC;IAClB,CAAC;IAED,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YACpD,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YAClB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACnB,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,sEAAsE;YACtE,yDAAyD;YACzD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC;IACL,CAAC;IAED,6BAA6B;IAC7B,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEX,iBAAiB;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAClB,SAAS;QACb,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,SAAS;QACb,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACxB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChC,CAAC;QAED,oBAAoB;QACpB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,8EAA8E;YAC9E,SAAS;QACb,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAClB,SAAS;YACb,CAAC;YAED,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,OAAO,EAAE,CAAC;gBACtE,MAAM,EAAE,GAAG,OAAO,CAAC;gBACnB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACxB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;gBAEnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC3D,mCAAmC;oBACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;oBACb,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;oBACb,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oBACZ,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBAChB,CAAC;gBAED,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC3B,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;gBAC7B,CAAC;gBAED,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IAED,kBAAkB;IAClB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,OAAO,EAAE,CAAC;YACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QAED,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,EAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAC,CAAC;AACtC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CACpB,KAAqB,EACrB,CAAS;IAET,MAAM,EAAC,QAAQ,EAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAK,CAAC;IAE3B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;QAClC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACZ,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC5B,KAAqB,EACrB,CAAS;IAET,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAa,CAAC;IAEtC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,SAAS,EAAE,CAAC;YACZ,MAAM,aAAa,GAAG,IAAI,GAAG,EAAK,CAAC;YACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChC,CAAC;YACL,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACtC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAAqB;IAErB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IACvC,MAAM,QAAQ,GAAQ,EAAE,CAAC;IAEzB,aAAa;IACb,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,KAAK,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,iBAAiB;IACjB,OAAO,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QACtC,2BAA2B;QACvB,IAAI,SAAS,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAsB,CAAC;QAE3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,SAAS,EAAE,CAAC;gBAC9C,SAAS,GAAG,GAAG,CAAC;gBAChB,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM;QACV,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEvB,mBAAmB;QACnB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,cAAc,GAAG,CAAC,CAAC,CAAC;gBAC7C,CAAC;gBAED,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAClB,KAAqB,EACrB,CAAS;IAET,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACxD,CAAC;IAED,gCAAgC;IAChC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhC,mBAAmB;IACnB,KAAK,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB;gBAC5B,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAChB,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;IACL,CAAC;IAED,kBAAkB;IAClB,KAAK,MAAM,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,UAAU,EAAE,CAAC;oBACb,oCAAoC;oBACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;wBACzB,IAAI,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;4BAC7B,wBAAwB;4BACxB,MAAM,KAAK,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;4BAC1C,MAAM,KAAK,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;4BAC1C,MAAM,KAAK,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;4BAE1C,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC5C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gCAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC7C,CAAC;4BAED,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gCAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC7C,CAAC;4BAED,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gCAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC7C,CAAC;wBACL,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,2CAA2C;IAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IAC3C,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,OAAO,OAAO,EAAE,CAAC;QACb,OAAO,GAAG,KAAK,CAAC;QAChB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACnB,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QAED,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC1B,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACb,CAAC;YAED,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACX,SAAS;YACb,CAAC;YAED,4CAA4C;YAC5C,MAAM,KAAK,GAAG,CAAM,CAAC;YACrB,MAAM,KAAK,GAAG,CAAM,CAAC;YACrB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEpC,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;gBAC3B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBACzB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBACpB,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC5F,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;wBAE5F,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BACzB,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC5C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gCAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC7C,CAAC;wBACL,CAAC;wBAED,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BACzB,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC5C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gCAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC7C,CAAC;wBACL,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,WAAW,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CACxB,aAAqC;IAErC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAa,CAAC;IAExC,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;QACtC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,UAAU,EAAE,CAAC;gBACb,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;YAED,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACjC,CAAC;YAED,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,UAAU,EAAE,CAAC;gBACb,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC"}

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

@@ -0,0 +1,36 @@
+import type { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+/**
+ * Markov Clustering (MCL) algorithm implementation
+ *
+ * MCL simulates flow in graphs and finds clusters based on the notion that
+ * random walks stay within clusters and rarely move between clusters.
+ * The algorithm alternates between expansion (matrix squaring) and
+ * inflation (element-wise powering and normalization).
+ *
+ * Time complexity: O(V³) per iteration
+ * Space complexity: O(V²)
+ */
+export interface MCLOptions {
+    expansion?: number;
+    inflation?: number;
+    maxIterations?: number;
+    tolerance?: number;
+    pruningThreshold?: number;
+    selfLoops?: boolean;
+}
+export interface MCLResult {
+    communities: NodeId[][];
+    attractors: Set<NodeId>;
+    iterations: number;
+    converged: boolean;
+}
+/**
+ * Perform Markov Clustering on a graph
+ */
+export declare function markovClustering(graph: Graph, options?: MCLOptions): MCLResult;
+/**
+ * Calculate modularity of MCL clustering result
+ */
+export declare function calculateMCLModularity(graph: Graph, communities: NodeId[][]): number;
+//# sourceMappingURL=mcl.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mcl.d.ts","sourceRoot":"","sources":["../../../src/clustering/mcl.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AAC5C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAE9C;;;;;;;;;;GAUG;AAEH,MAAM,WAAW,UAAU;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,SAAS,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,SAAS;IACtB,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACtB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC5B,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,UAAe,GACzB,SAAS,CAyDX;AAkUD;;GAEG;AACH,wBAAgB,sBAAsB,CAClC,KAAK,EAAE,KAAK,EACZ,WAAW,EAAE,MAAM,EAAE,EAAE,GACxB,MAAM,CA+BR"}