@graphty/algorithms 1.0.1 → 1.2.0

package/dist/src/algorithms/community/label-propagation.js

@@ -0,0 +1,307 @@
+/**
+ * Label Propagation Algorithm for Community Detection
+ *
+ * A fast, near-linear time algorithm that detects communities by
+ * propagating labels through the network. Each node adopts the label
+ * that most of its neighbors have.
+ *
+ * Reference: Raghavan et al. (2007) "Near linear time algorithm to
+ * detect community structures in large-scale networks"
+ */
+/**
+ * Label Propagation Algorithm
+ * Each node adopts the most frequent label among its neighbors
+ *
+ * @param graph - Undirected graph (can be weighted)
+ * @param options - Algorithm options
+ * @returns Community assignments
+ *
+ * Time Complexity: O(m) per iteration, typically O(km) for k iterations
+ * Space Complexity: O(n)
+ */
+export function labelPropagation(graph, options = {}) {
+    const { maxIterations = 100, randomSeed = 42, } = options;
+    if (graph.size === 0) {
+        return {
+            communities: new Map(),
+            iterations: 0,
+            converged: true,
+        };
+    }
+    // Initialize random number generator
+    let seed = randomSeed;
+    const random = () => {
+        seed = ((seed * 1664525) + 1013904223) % 2147483647;
+        return seed / 2147483647;
+    };
+    // Initialize labels - each node gets its own label
+    const labels = new Map();
+    const nodes = Array.from(graph.keys());
+    nodes.forEach((node, i) => labels.set(node, i));
+    let iterations = 0;
+    let converged = false;
+    // Main loop
+    while (iterations < maxIterations && !converged) {
+        iterations++;
+        converged = true;
+        // Create random order for node updates
+        const nodeOrder = [...nodes];
+        shuffle(nodeOrder, random);
+        // Update each node's label
+        for (const node of nodeOrder) {
+            const neighbors = graph.get(node);
+            if (!neighbors || neighbors.size === 0) {
+                continue;
+            }
+            // Count label frequencies among neighbors
+            const labelCounts = new Map();
+            let maxCount = 0;
+            const candidateLabels = [];
+            for (const [neighbor, weight] of neighbors) {
+                const neighborLabel = labels.get(neighbor);
+                if (neighborLabel === undefined) {
+                    continue;
+                }
+                const count = (labelCounts.get(neighborLabel) ?? 0) + weight;
+                labelCounts.set(neighborLabel, count);
+                if (count > maxCount) {
+                    maxCount = count;
+                    candidateLabels.length = 0;
+                    candidateLabels.push(neighborLabel);
+                }
+                else if (count === maxCount) {
+                    candidateLabels.push(neighborLabel);
+                }
+            }
+            // Choose label (break ties randomly)
+            const currentLabel = labels.get(node);
+            if (currentLabel === undefined) {
+                continue;
+            }
+            let newLabel = currentLabel;
+            if (candidateLabels.length > 0) {
+                // Include current label if it has max count
+                if (labelCounts.get(currentLabel) === maxCount) {
+                    candidateLabels.push(currentLabel);
+                }
+                // Random selection from candidates
+                const index = Math.floor(random() * candidateLabels.length);
+                const selectedLabel = candidateLabels[index];
+                if (selectedLabel !== undefined) {
+                    newLabel = selectedLabel;
+                }
+            }
+            // Update label if changed
+            if (newLabel !== currentLabel) {
+                labels.set(node, newLabel);
+                converged = false;
+            }
+        }
+    }
+    // Renumber communities consecutively
+    const uniqueLabels = new Set(labels.values());
+    const labelMap = new Map();
+    let communityId = 0;
+    for (const label of uniqueLabels) {
+        labelMap.set(label, communityId++);
+    }
+    const communities = new Map();
+    for (const [node, label] of labels) {
+        const mappedLabel = labelMap.get(label);
+        if (mappedLabel !== undefined) {
+            communities.set(node, mappedLabel);
+        }
+    }
+    return {
+        communities,
+        iterations,
+        converged,
+    };
+}
+/**
+ * Asynchronous Label Propagation
+ * Updates all nodes simultaneously (can lead to oscillations)
+ */
+export function labelPropagationAsync(graph, options = {}) {
+    const { maxIterations = 100, } = options;
+    if (graph.size === 0) {
+        return {
+            communities: new Map(),
+            iterations: 0,
+            converged: true,
+        };
+    }
+    // Initialize labels
+    const labels = new Map();
+    const nodes = Array.from(graph.keys());
+    nodes.forEach((node, i) => labels.set(node, i));
+    let iterations = 0;
+    let converged = false;
+    // Main loop
+    while (iterations < maxIterations && !converged) {
+        iterations++;
+        converged = true;
+        // Store new labels
+        const newLabels = new Map();
+        // Update all nodes simultaneously
+        for (const node of nodes) {
+            const neighbors = graph.get(node);
+            if (!neighbors || neighbors.size === 0) {
+                const nodeLabel = labels.get(node);
+                if (nodeLabel !== undefined) {
+                    newLabels.set(node, nodeLabel);
+                }
+                continue;
+            }
+            // Count label frequencies
+            const labelCounts = new Map();
+            let maxCount = 0;
+            const nodeLabel = labels.get(node);
+            if (nodeLabel === undefined) {
+                continue;
+            }
+            let maxLabel = nodeLabel;
+            for (const [neighbor, weight] of neighbors) {
+                const neighborLabel = labels.get(neighbor);
+                if (neighborLabel === undefined) {
+                    continue;
+                }
+                const count = (labelCounts.get(neighborLabel) ?? 0) + weight;
+                labelCounts.set(neighborLabel, count);
+                if (count > maxCount || (count === maxCount && neighborLabel < maxLabel)) {
+                    maxCount = count;
+                    maxLabel = neighborLabel;
+                }
+            }
+            newLabels.set(node, maxLabel);
+            if (maxLabel !== labels.get(node)) {
+                converged = false;
+            }
+        }
+        // Apply new labels
+        for (const [node, label] of newLabels) {
+            labels.set(node, label);
+        }
+    }
+    // Renumber communities
+    const uniqueLabels = new Set(labels.values());
+    const labelMap = new Map();
+    let communityId = 0;
+    for (const label of uniqueLabels) {
+        labelMap.set(label, communityId++);
+    }
+    const communities = new Map();
+    for (const [node, label] of labels) {
+        const mappedLabel = labelMap.get(label);
+        if (mappedLabel !== undefined) {
+            communities.set(node, mappedLabel);
+        }
+    }
+    return {
+        communities,
+        iterations,
+        converged,
+    };
+}
+/**
+ * Semi-supervised Label Propagation
+ * Some nodes have fixed labels that don't change
+ */
+export function labelPropagationSemiSupervised(graph, seedLabels, options = {}) {
+    const { maxIterations = 100, randomSeed = 42, } = options;
+    // Initialize random number generator
+    let seed = randomSeed;
+    const random = () => {
+        seed = ((seed * 1664525) + 1013904223) % 2147483647;
+        return seed / 2147483647;
+    };
+    // Initialize labels
+    const labels = new Map();
+    const nodes = Array.from(graph.keys());
+    let labelCounter = Math.max(...Array.from(seedLabels.values())) + 1;
+    for (const node of nodes) {
+        if (seedLabels.has(node)) {
+            const seedLabel = seedLabels.get(node);
+            if (seedLabel !== undefined) {
+                labels.set(node, seedLabel);
+            }
+        }
+        else {
+            labels.set(node, labelCounter++);
+        }
+    }
+    let iterations = 0;
+    let converged = false;
+    // Main loop
+    while (iterations < maxIterations && !converged) {
+        iterations++;
+        converged = true;
+        // Create random order
+        const nodeOrder = nodes.filter((n) => !seedLabels.has(n));
+        shuffle(nodeOrder, random);
+        // Update non-seed nodes
+        for (const node of nodeOrder) {
+            const neighbors = graph.get(node);
+            if (!neighbors || neighbors.size === 0) {
+                continue;
+            }
+            // Count label frequencies
+            const labelCounts = new Map();
+            let maxCount = 0;
+            const candidateLabels = [];
+            for (const [neighbor, weight] of neighbors) {
+                const neighborLabel = labels.get(neighbor);
+                if (neighborLabel === undefined) {
+                    continue;
+                }
+                const count = (labelCounts.get(neighborLabel) ?? 0) + weight;
+                labelCounts.set(neighborLabel, count);
+                if (count > maxCount) {
+                    maxCount = count;
+                    candidateLabels.length = 0;
+                    candidateLabels.push(neighborLabel);
+                }
+                else if (count === maxCount) {
+                    candidateLabels.push(neighborLabel);
+                }
+            }
+            // Choose label
+            const currentLabel = labels.get(node);
+            if (currentLabel === undefined) {
+                continue;
+            }
+            let newLabel = currentLabel;
+            if (candidateLabels.length > 0) {
+                const index = Math.floor(random() * candidateLabels.length);
+                const selectedLabel = candidateLabels[index];
+                if (selectedLabel !== undefined) {
+                    newLabel = selectedLabel;
+                }
+            }
+            if (newLabel !== currentLabel) {
+                labels.set(node, newLabel);
+                converged = false;
+            }
+        }
+    }
+    return {
+        communities: labels,
+        iterations,
+        converged,
+    };
+}
+/**
+ * Fisher-Yates shuffle
+ */
+function shuffle(array, random) {
+    for (let i = array.length - 1; i > 0; i--) {
+        const j = Math.floor(random() * (i + 1));
+        const temp = array[i];
+        const swapItem = array[j];
+        if (temp !== undefined && swapItem !== undefined) {
+            array[i] = swapItem;
+            array[j] = temp;
+        }
+    }
+}
+//# sourceMappingURL=label-propagation.js.map

package/dist/src/algorithms/community/label-propagation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"label-propagation.js","sourceRoot":"","sources":["../../../../src/algorithms/community/label-propagation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAaH;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAC5B,KAAuC,EACvC,UAAmC,EAAE;IAErC,MAAM,EACF,aAAa,GAAG,GAAG,EACnB,UAAU,GAAG,EAAE,GAClB,GAAG,OAAO,CAAC;IAEZ,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO;YACH,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,IAAI;SAClB,CAAC;IACN,CAAC;IAED,qCAAqC;IACrC,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,MAAM,MAAM,GAAG,GAAW,EAAE;QACxB,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC;QACpD,OAAO,IAAI,GAAG,UAAU,CAAC;IAC7B,CAAC,CAAC;IAEF,mDAAmD;IACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,YAAY;IACZ,OAAO,UAAU,GAAG,aAAa,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9C,UAAU,EAAE,CAAC;QACb,SAAS,GAAG,IAAI,CAAC;QAEjB,uCAAuC;QACvC,MAAM,SAAS,GAAG,CAAC,GAAI,KAAK,CAAC,CAAC;QAC9B,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE3B,2BAA2B;QAC3B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACrC,SAAS;YACb,CAAC;YAED,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,eAAe,GAAa,EAAE,CAAC;YAErC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACzC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAC9B,SAAS;gBACb,CAAC;gBAED,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAC7D,WAAW,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;gBAEtC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACnB,QAAQ,GAAG,KAAK,CAAC;oBACjB,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC3B,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxC,CAAC;qBAAM,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC5B,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxC,CAAC;YACL,CAAC;YAED,qCAAqC;YACrC,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC7B,SAAS;YACb,CAAC;YAED,IAAI,QAAQ,GAAG,YAAY,CAAC;YAE5B,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,4CAA4C;gBAC5C,IAAI,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,QAAQ,EAAE,CAAC;oBAC7C,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACvC,CAAC;gBAED,mCAAmC;gBACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;gBAC5D,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;gBAC7C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAC9B,QAAQ,GAAG,aAAa,CAAC;gBAC7B,CAAC;YACL,CAAC;YAED,0BAA0B;YAC1B,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3B,SAAS,GAAG,KAAK,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IAED,qCAAqC;IACrC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QACvC,CAAC;IACL,CAAC;IAED,OAAO;QACH,WAAW;QACX,UAAU;QACV,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACjC,KAAuC,EACvC,UAAmC,EAAE;IAErC,MAAM,EACF,aAAa,GAAG,GAAG,GACtB,GAAG,OAAO,CAAC;IAEZ,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO;YACH,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,IAAI;SAClB,CAAC;IACN,CAAC;IAED,oBAAoB;IACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,YAAY;IACZ,OAAO,UAAU,GAAG,aAAa,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9C,UAAU,EAAE,CAAC;QACb,SAAS,GAAG,IAAI,CAAC;QAEjB,mBAAmB;QACnB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,kCAAkC;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACrC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBACnC,CAAC;gBAED,SAAS;YACb,CAAC;YAED,0BAA0B;YAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC1B,SAAS;YACb,CAAC;YAED,IAAI,QAAQ,GAAG,SAAS,CAAC;YAEzB,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACzC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAC9B,SAAS;gBACb,CAAC;gBAED,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAC7D,WAAW,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;gBAEtC,IAAI,KAAK,GAAG,QAAQ,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,aAAa,GAAG,QAAQ,CAAC,EAAE,CAAC;oBACvE,QAAQ,GAAG,KAAK,CAAC;oBACjB,QAAQ,GAAG,aAAa,CAAC;gBAC7B,CAAC;YACL,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAE9B,IAAI,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,KAAK,CAAC;YACtB,CAAC;QACL,CAAC;QAED,mBAAmB;QACnB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,uBAAuB;IACvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QACvC,CAAC;IACL,CAAC;IAED,OAAO;QACH,WAAW;QACX,UAAU;QACV,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,8BAA8B,CAC1C,KAAuC,EACvC,UAA+B,EAC/B,UAAmC,EAAE;IAErC,MAAM,EACF,aAAa,GAAG,GAAG,EACnB,UAAU,GAAG,EAAE,GAClB,GAAG,OAAO,CAAC;IAEZ,qCAAqC;IACrC,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,MAAM,MAAM,GAAG,GAAW,EAAE;QACxB,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC;QACpD,OAAO,IAAI,GAAG,UAAU,CAAC;IAC7B,CAAC,CAAC;IAEF,oBAAoB;IACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAErE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,YAAY;IACZ,OAAO,UAAU,GAAG,aAAa,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9C,UAAU,EAAE,CAAC;QACb,SAAS,GAAG,IAAI,CAAC;QAEjB,sBAAsB;QACtB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE3B,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACrC,SAAS;YACb,CAAC;YAED,0BAA0B;YAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,eAAe,GAAa,EAAE,CAAC;YAErC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACzC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAC9B,SAAS;gBACb,CAAC;gBAED,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAC7D,WAAW,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;gBAEtC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACnB,QAAQ,GAAG,KAAK,CAAC;oBACjB,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC3B,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxC,CAAC;qBAAM,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC5B,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxC,CAAC;YACL,CAAC;YAED,eAAe;YACf,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC7B,SAAS;YACb,CAAC;YAED,IAAI,QAAQ,GAAG,YAAY,CAAC;YAE5B,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;gBAC5D,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;gBAC7C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAC9B,QAAQ,GAAG,aAAa,CAAC;gBAC7B,CAAC;YACL,CAAC;YAED,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3B,SAAS,GAAG,KAAK,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,WAAW,EAAE,MAAM;QACnB,UAAU;QACV,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,OAAO,CAAC,KAAgB,EAAE,MAAoB;IACnD,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/C,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACpB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC;IACL,CAAC;AACL,CAAC"}

package/dist/src/algorithms/community/leiden.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Leiden Algorithm for Community Detection
+ *
+ * An improved version of the Louvain algorithm that guarantees
+ * well-connected communities and provides better quality partitions.
+ *
+ * Reference: Traag, V.A., Waltman, L. & van Eck, N.J. (2019)
+ * "From Louvain to Leiden: guaranteeing well-connected communities"
+ */
+export interface LeidenOptions {
+    resolution?: number;
+    randomSeed?: number;
+    maxIterations?: number;
+    threshold?: number;
+}
+export interface LeidenResult {
+    communities: Map<string, number>;
+    modularity: number;
+    iterations: number;
+}
+/**
+ * Leiden algorithm for community detection
+ * Improves upon Louvain by ensuring well-connected communities
+ *
+ * @param graph - Undirected weighted graph
+ * @param options - Algorithm options
+ * @returns Community assignments and modularity
+ *
+ * Time Complexity: O(m) per iteration, typically O(m log m) total
+ * Space Complexity: O(n + m)
+ */
+export declare function leiden(graph: Map<string, Map<string, number>>, options?: LeidenOptions): LeidenResult;
+//# sourceMappingURL=leiden.d.ts.map

package/dist/src/algorithms/community/leiden.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leiden.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/community/leiden.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,MAAM,WAAW,aAAa;IAC1B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IACzB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAClB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACvC,OAAO,GAAE,aAAkB,GAC5B,YAAY,CAgKd"}