@graphty/algorithms 1.2.0 → 1.4.2

package/dist/src/algorithms/community/louvain-optimized.d.ts

@@ -0,0 +1,149 @@
+import type { Graph } from "../../core/graph.js";
+import type { CommunityResult } from "../../types/index.js";
+/**
+ * Optimized Louvain community detection algorithm with early pruning and threshold cycling
+ *
+ * Key optimizations:
+ * - Leaf node pruning: Skip nodes with degree 1
+ * - Importance ordering: Process high-impact nodes first
+ * - Threshold cycling: Adaptive convergence thresholds
+ * - Early termination: Stop when changes become insignificant
+ *
+ * Expected speedup: 2-5x on large graphs with many leaf nodes
+ */
+export interface OptimizedLouvainOptions {
+    /**
+     * Resolution parameter (default: 1.0)
+     */
+    resolution?: number;
+    /**
+     * Maximum iterations per level (default: 100)
+     */
+    maxIterations?: number;
+    /**
+     * Convergence tolerance (default: 1e-6)
+     */
+    tolerance?: number;
+    /**
+     * Enable leaf node pruning (default: true)
+     */
+    pruneLeaves?: boolean;
+    /**
+     * Enable importance-based node ordering (default: true)
+     */
+    importanceOrdering?: boolean;
+    /**
+     * Base pruning threshold (default: 0.01)
+     */
+    pruningThreshold?: number;
+    /**
+     * Enable adaptive threshold cycling (default: true)
+     */
+    thresholdCycling?: boolean;
+}
+interface PruningStats {
+    leafNodesPruned: number;
+    lowDegreeNodesPruned: number;
+    stableNodesPruned: number;
+}
+/**
+ * Optimized Louvain implementation with early pruning and threshold cycling
+ */
+export declare class OptimizedLouvain {
+    private graph;
+    private communities;
+    private communityWeights;
+    private nodeWeights;
+    private nodeDegrees;
+    private totalWeight;
+    private pruningStats;
+    /**
+     * Create an optimized Louvain detector for the given graph
+     * @param graph - The input graph to detect communities in
+     */
+    constructor(graph: Graph);
+    /**
+     * Run optimized Louvain algorithm
+     * @param options - Algorithm configuration options
+     * @returns Community detection result with communities, modularity, and iterations
+     */
+    detectCommunities(options?: OptimizedLouvainOptions): CommunityResult;
+    /**
+     * Initialize data structures
+     */
+    private initialize;
+    /**
+     * Get nodes ordered by importance (degree * log(weight))
+     * @returns Array of node IDs sorted by descending importance
+     */
+    private getNodesInImportanceOrder;
+    /**
+     * Perform local moving phase with optimizations
+     * @param nodes - Array of node IDs to process
+     * @param options - Local moving options
+     * @param options.pruneLeaves - Whether to skip leaf nodes
+     * @param options.threshold - Minimum gain threshold for moves
+     * @param options.resolution - Resolution parameter for modularity
+     * @returns True if any improvement was made, false otherwise
+     */
+    private performLocalMoving;
+    /**
+     * Check if node is a leaf (degree 1)
+     * @param nodeId - The node ID to check
+     * @returns True if the node has degree 1, false otherwise
+     */
+    private isLeafNode;
+    /**
+     * Get adaptive threshold that decreases with iterations
+     * @param iteration - Current iteration number
+     * @param baseThreshold - Base threshold value to scale
+     * @returns Adaptive threshold value that decays over iterations
+     */
+    private getAdaptiveThreshold;
+    /**
+     * Calculate modularity gain from moving a node to a community
+     * @param nodeId - The node ID to move
+     * @param targetCommunity - The target community ID
+     * @param resolution - Resolution parameter for modularity calculation
+     * @returns The modularity gain from moving the node
+     */
+    private calculateModularityGain;
+    /**
+     * Remove node from community (for gain calculation)
+     * @param nodeId - The node ID to remove
+     * @param community - The community ID to remove from
+     */
+    private removeNodeFromCommunity;
+    /**
+     * Add node to community
+     * @param nodeId - The node ID to add
+     * @param community - The community ID to add to
+     */
+    private addNodeToCommunity;
+    /**
+     * Get neighboring communities of a node
+     * @param nodeId - The node ID to find neighbor communities for
+     * @returns Set of community IDs that neighbors belong to
+     */
+    private getNeighborCommunities;
+    /**
+     * Calculate total modularity
+     * @param resolution - Resolution parameter for modularity calculation
+     * @returns The modularity score of the current partition
+     */
+    private calculateModularity;
+    /**
+     * Get pruning statistics
+     * @returns Statistics about nodes pruned during optimization
+     */
+    getPruningStats(): PruningStats;
+}
+/**
+ * Optimized Louvain algorithm with automatic optimization selection
+ * @param graph - The input graph to detect communities in
+ * @param options - Algorithm configuration options
+ * @returns Community detection result with communities, modularity, and iterations
+ */
+export declare function louvainOptimized(graph: Graph, options?: OptimizedLouvainOptions): CommunityResult;
+export {};
+//# sourceMappingURL=louvain-optimized.d.ts.map

package/dist/src/algorithms/community/louvain-optimized.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"louvain-optimized.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/community/louvain-optimized.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,KAAK,EAAE,eAAe,EAAU,MAAM,sBAAsB,CAAC;AAEpE;;;;;;;;;;GAUG;AAEH,MAAM,WAAW,uBAAuB;IACpC;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;OAEG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;OAEG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B;;OAEG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;OAEG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,UAAU,YAAY;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,iBAAiB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,qBAAa,gBAAgB;IACzB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,gBAAgB,CAAsB;IAC9C,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,YAAY,CAAe;IAEnC;;;OAGG;gBACS,KAAK,EAAE,KAAK;IAcxB;;;;OAIG;IACI,iBAAiB,CAAC,OAAO,GAAE,uBAA4B,GAAG,eAAe;IAmEhF;;OAEG;IACH,OAAO,CAAC,UAAU;IA2ClB;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IAiBjC;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IAoE1B;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAKlB;;;;;OAKG;IACH,OAAO,CAAC,oBAAoB;IAM5B;;;;;;OAMG;IACH,OAAO,CAAC,uBAAuB;IAiC/B;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IAM/B;;;;OAIG;IACH,OAAO,CAAC,kBAAkB;IAM1B;;;;OAIG;IACH,OAAO,CAAC,sBAAsB;IAuB9B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwC3B;;;OAGG;IACI,eAAe,IAAI,YAAY;CAGzC;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,uBAA4B,GAAG,eAAe,CAGrG"}

package/dist/src/algorithms/community/louvain-optimized.js

@@ -0,0 +1,338 @@
+/**
+ * Optimized Louvain implementation with early pruning and threshold cycling
+ */
+export class OptimizedLouvain {
+    /**
+     * Create an optimized Louvain detector for the given graph
+     * @param graph - The input graph to detect communities in
+     */
+    constructor(graph) {
+        this.graph = graph;
+        this.communities = new Map();
+        this.communityWeights = new Map();
+        this.nodeWeights = new Map();
+        this.nodeDegrees = new Map();
+        this.totalWeight = 0;
+        this.pruningStats = {
+            leafNodesPruned: 0,
+            lowDegreeNodesPruned: 0,
+            stableNodesPruned: 0,
+        };
+    }
+    /**
+     * Run optimized Louvain algorithm
+     * @param options - Algorithm configuration options
+     * @returns Community detection result with communities, modularity, and iterations
+     */
+    detectCommunities(options = {}) {
+        const { resolution = 1.0, maxIterations = 100, tolerance = 1e-6, pruneLeaves = true, importanceOrdering = true, pruningThreshold = 0.01, thresholdCycling = true, } = options;
+        // Initialize
+        this.initialize();
+        let modularity = this.calculateModularity(resolution);
+        let iteration = 0;
+        let improved = true;
+        while (iteration < maxIterations && improved) {
+            // Get nodes in optimal processing order
+            const orderedNodes = importanceOrdering
+                ? this.getNodesInImportanceOrder()
+                : Array.from(this.graph.nodes()).map((n) => n.id);
+            // Apply adaptive threshold
+            const threshold = thresholdCycling ? this.getAdaptiveThreshold(iteration, pruningThreshold) : 0;
+            // Perform local optimization
+            improved = this.performLocalMoving(orderedNodes, {
+                pruneLeaves,
+                threshold,
+                resolution,
+            });
+            if (improved) {
+                const newModularity = this.calculateModularity(resolution);
+                // Check convergence
+                if (Math.abs(newModularity - modularity) < tolerance) {
+                    break;
+                }
+                modularity = newModularity;
+                iteration++;
+            }
+        }
+        // Convert community assignments to result format
+        const communityGroups = new Map();
+        for (const [nodeId, community] of this.communities) {
+            if (!communityGroups.has(community)) {
+                communityGroups.set(community, []);
+            }
+            const group = communityGroups.get(community);
+            if (group) {
+                group.push(nodeId);
+            }
+        }
+        return {
+            communities: Array.from(communityGroups.values()),
+            modularity,
+            iterations: iteration,
+        };
+    }
+    /**
+     * Initialize data structures
+     */
+    initialize() {
+        let communityId = 0;
+        // Initialize each node in its own community
+        for (const node of this.graph.nodes()) {
+            this.communities.set(node.id, communityId);
+            // Calculate node weight and degree
+            let nodeWeight = 0;
+            let degree = 0;
+            for (const neighbor of Array.from(this.graph.neighbors(node.id))) {
+                const edge = this.graph.getEdge(node.id, neighbor);
+                const weight = edge?.weight ?? 1;
+                nodeWeight += weight;
+                degree++;
+            }
+            // For undirected graphs, also check incoming edges
+            if (!this.graph.isDirected) {
+                for (const neighbor of Array.from(this.graph.inNeighbors(node.id))) {
+                    if (!this.graph.hasEdge(node.id, neighbor)) {
+                        const edge = this.graph.getEdge(neighbor, node.id);
+                        const weight = edge?.weight ?? 1;
+                        nodeWeight += weight;
+                        degree++;
+                    }
+                }
+            }
+            this.nodeWeights.set(node.id, nodeWeight);
+            this.nodeDegrees.set(node.id, degree);
+            this.communityWeights.set(communityId, nodeWeight);
+            this.totalWeight += nodeWeight;
+            communityId++;
+        }
+        // Total weight is sum of all edge weights
+        // For undirected graphs, each edge is counted twice from both endpoints
+        this.totalWeight = this.totalWeight / 2;
+    }
+    /**
+     * Get nodes ordered by importance (degree * log(weight))
+     * @returns Array of node IDs sorted by descending importance
+     */
+    getNodesInImportanceOrder() {
+        const nodeImportance = new Map();
+        for (const [nodeId, degree] of this.nodeDegrees) {
+            const weight = this.nodeWeights.get(nodeId) ?? 0;
+            // Importance score: combination of degree and weight
+            // High-degree nodes and nodes with heavy edges are processed first
+            const importance = degree * Math.log(1 + weight);
+            nodeImportance.set(nodeId, importance);
+        }
+        // Sort by importance (descending)
+        return Array.from(nodeImportance.entries())
+            .sort((a, b) => b[1] - a[1])
+            .map(([nodeId]) => nodeId);
+    }
+    /**
+     * Perform local moving phase with optimizations
+     * @param nodes - Array of node IDs to process
+     * @param options - Local moving options
+     * @param options.pruneLeaves - Whether to skip leaf nodes
+     * @param options.threshold - Minimum gain threshold for moves
+     * @param options.resolution - Resolution parameter for modularity
+     * @returns True if any improvement was made, false otherwise
+     */
+    performLocalMoving(nodes, options) {
+        const { pruneLeaves, threshold, resolution } = options;
+        let improvement = false;
+        let hasChanged = true;
+        while (hasChanged) {
+            hasChanged = false;
+            for (const nodeId of nodes) {
+                // Early pruning: skip leaf nodes
+                if (pruneLeaves && this.isLeafNode(nodeId)) {
+                    this.pruningStats.leafNodesPruned++;
+                    continue;
+                }
+                const currentCommunity = this.communities.get(nodeId) ?? 0;
+                const neighborCommunities = this.getNeighborCommunities(nodeId);
+                // Skip isolated nodes
+                if (neighborCommunities.size === 0) {
+                    continue;
+                }
+                // Find best community to move to
+                let bestCommunity = currentCommunity;
+                let bestGain = 0;
+                // Remove node from its current community to calculate gains
+                this.removeNodeFromCommunity(nodeId, currentCommunity);
+                for (const community of neighborCommunities) {
+                    const gain = this.calculateModularityGain(nodeId, community, resolution);
+                    // Apply threshold - only move if gain exceeds threshold
+                    if (gain > bestGain + threshold) {
+                        bestGain = gain;
+                        bestCommunity = community;
+                    }
+                }
+                // Try staying in current community
+                const currentGain = this.calculateModularityGain(nodeId, currentCommunity, resolution);
+                if (currentGain > bestGain + threshold) {
+                    bestGain = currentGain;
+                    bestCommunity = currentCommunity;
+                }
+                // Add node to best community
+                this.addNodeToCommunity(nodeId, bestCommunity);
+                // Track if node moved
+                if (bestCommunity !== currentCommunity) {
+                    hasChanged = true;
+                    improvement = true;
+                }
+            }
+        }
+        return improvement;
+    }
+    /**
+     * Check if node is a leaf (degree 1)
+     * @param nodeId - The node ID to check
+     * @returns True if the node has degree 1, false otherwise
+     */
+    isLeafNode(nodeId) {
+        const degree = this.nodeDegrees.get(nodeId) ?? 0;
+        return degree === 1;
+    }
+    /**
+     * Get adaptive threshold that decreases with iterations
+     * @param iteration - Current iteration number
+     * @param baseThreshold - Base threshold value to scale
+     * @returns Adaptive threshold value that decays over iterations
+     */
+    getAdaptiveThreshold(iteration, baseThreshold) {
+        // Exponentially decay threshold with iterations
+        // This allows coarse movements early and fine-tuning later
+        return baseThreshold * Math.pow(0.5, iteration / 10);
+    }
+    /**
+     * Calculate modularity gain from moving a node to a community
+     * @param nodeId - The node ID to move
+     * @param targetCommunity - The target community ID
+     * @param resolution - Resolution parameter for modularity calculation
+     * @returns The modularity gain from moving the node
+     */
+    calculateModularityGain(nodeId, targetCommunity, resolution) {
+        const nodeWeight = this.nodeWeights.get(nodeId) ?? 0;
+        // Sum of weights from node to target community
+        let weightToTarget = 0;
+        for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+            if (this.communities.get(neighbor) === targetCommunity) {
+                const edge = this.graph.getEdge(nodeId, neighbor);
+                weightToTarget += edge?.weight ?? 1;
+            }
+        }
+        // For undirected graphs, also check incoming edges
+        if (!this.graph.isDirected) {
+            for (const neighbor of Array.from(this.graph.inNeighbors(nodeId))) {
+                if (this.communities.get(neighbor) === targetCommunity && !this.graph.hasEdge(nodeId, neighbor)) {
+                    const edge = this.graph.getEdge(neighbor, nodeId);
+                    weightToTarget += edge?.weight ?? 1;
+                }
+            }
+        }
+        // Weight of target community
+        const targetWeight = this.communityWeights.get(targetCommunity) ?? 0;
+        // Modularity gain formula
+        const gain = (weightToTarget - (resolution * nodeWeight * targetWeight) / (2 * this.totalWeight)) / this.totalWeight;
+        return gain;
+    }
+    /**
+     * Remove node from community (for gain calculation)
+     * @param nodeId - The node ID to remove
+     * @param community - The community ID to remove from
+     */
+    removeNodeFromCommunity(nodeId, community) {
+        const nodeWeight = this.nodeWeights.get(nodeId) ?? 0;
+        this.communityWeights.set(community, (this.communityWeights.get(community) ?? 0) - nodeWeight);
+        this.communities.delete(nodeId);
+    }
+    /**
+     * Add node to community
+     * @param nodeId - The node ID to add
+     * @param community - The community ID to add to
+     */
+    addNodeToCommunity(nodeId, community) {
+        const nodeWeight = this.nodeWeights.get(nodeId) ?? 0;
+        this.communityWeights.set(community, (this.communityWeights.get(community) ?? 0) + nodeWeight);
+        this.communities.set(nodeId, community);
+    }
+    /**
+     * Get neighboring communities of a node
+     * @param nodeId - The node ID to find neighbor communities for
+     * @returns Set of community IDs that neighbors belong to
+     */
+    getNeighborCommunities(nodeId) {
+        const communities = new Set();
+        for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+            const community = this.communities.get(neighbor);
+            if (community !== undefined) {
+                communities.add(community);
+            }
+        }
+        // For undirected graphs, also check incoming edges
+        if (!this.graph.isDirected) {
+            for (const neighbor of Array.from(this.graph.inNeighbors(nodeId))) {
+                const community = this.communities.get(neighbor);
+                if (community !== undefined) {
+                    communities.add(community);
+                }
+            }
+        }
+        return communities;
+    }
+    /**
+     * Calculate total modularity
+     * @param resolution - Resolution parameter for modularity calculation
+     * @returns The modularity score of the current partition
+     */
+    calculateModularity(resolution) {
+        if (this.totalWeight === 0) {
+            return 0;
+        }
+        let modularity = 0;
+        // Sum over all communities
+        const communityInternalWeights = new Map();
+        // Calculate internal weights for each community
+        for (const node of this.graph.nodes()) {
+            const nodeId = node.id;
+            const community = this.communities.get(nodeId) ?? 0;
+            for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                if (this.communities.get(neighbor) === community) {
+                    const edge = this.graph.getEdge(nodeId, neighbor);
+                    const weight = edge?.weight ?? 1;
+                    communityInternalWeights.set(community, (communityInternalWeights.get(community) ?? 0) + weight);
+                }
+            }
+        }
+        // Calculate modularity
+        for (const [community, internalWeight] of communityInternalWeights) {
+            const communityWeight = this.communityWeights.get(community) ?? 0;
+            // For undirected graphs, internal weights are counted twice
+            const aIn = this.graph.isDirected ? internalWeight : internalWeight / 2;
+            const aTotal = communityWeight;
+            // Modularity formula: sum of (fraction of edges within community - expected fraction)
+            const actualFraction = aIn / this.totalWeight;
+            const expectedFraction = resolution * Math.pow(aTotal / (2 * this.totalWeight), 2);
+            modularity += actualFraction - expectedFraction;
+        }
+        return modularity;
+    }
+    /**
+     * Get pruning statistics
+     * @returns Statistics about nodes pruned during optimization
+     */
+    getPruningStats() {
+        return { ...this.pruningStats };
+    }
+}
+/**
+ * Optimized Louvain algorithm with automatic optimization selection
+ * @param graph - The input graph to detect communities in
+ * @param options - Algorithm configuration options
+ * @returns Community detection result with communities, modularity, and iterations
+ */
+export function louvainOptimized(graph, options = {}) {
+    const optimizer = new OptimizedLouvain(graph);
+    return optimizer.detectCommunities(options);
+}
+//# sourceMappingURL=louvain-optimized.js.map

package/dist/src/algorithms/community/louvain-optimized.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"louvain-optimized.js","sourceRoot":"","sources":["../../../../src/algorithms/community/louvain-optimized.ts"],"names":[],"mappings":"AAoDA;;GAEG;AACH,MAAM,OAAO,gBAAgB;IASzB;;;OAGG;IACH,YAAY,KAAY;QACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG;YAChB,eAAe,EAAE,CAAC;YAClB,oBAAoB,EAAE,CAAC;YACvB,iBAAiB,EAAE,CAAC;SACvB,CAAC;IACN,CAAC;IAED;;;;OAIG;IACI,iBAAiB,CAAC,UAAmC,EAAE;QAC1D,MAAM,EACF,UAAU,GAAG,GAAG,EAChB,aAAa,GAAG,GAAG,EACnB,SAAS,GAAG,IAAI,EAChB,WAAW,GAAG,IAAI,EAClB,kBAAkB,GAAG,IAAI,EACzB,gBAAgB,GAAG,IAAI,EACvB,gBAAgB,GAAG,IAAI,GAC1B,GAAG,OAAO,CAAC;QAEZ,aAAa;QACb,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,OAAO,SAAS,GAAG,aAAa,IAAI,QAAQ,EAAE,CAAC;YAC3C,wCAAwC;YACxC,MAAM,YAAY,GAAG,kBAAkB;gBACnC,CAAC,CAAC,IAAI,CAAC,yBAAyB,EAAE;gBAClC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAEtD,2BAA2B;YAC3B,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhG,6BAA6B;YAC7B,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,YAAY,EAAE;gBAC7C,WAAW;gBACX,SAAS;gBACT,UAAU;aACb,CAAC,CAAC;YAEH,IAAI,QAAQ,EAAE,CAAC;gBACX,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBAE3D,oBAAoB;gBACpB,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,UAAU,CAAC,GAAG,SAAS,EAAE,CAAC;oBACnD,MAAM;gBACV,CAAC;gBAED,UAAU,GAAG,aAAa,CAAC;gBAC3B,SAAS,EAAE,CAAC;YAChB,CAAC;QACL,CAAC;QAED,iDAAiD;QACjD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEpD,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACjD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YACvC,CAAC;YAED,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC7C,IAAI,KAAK,EAAE,CAAC;gBACR,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACL,CAAC;QAED,OAAO;YACH,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;YACjD,UAAU;YACV,UAAU,EAAE,SAAS;SACxB,CAAC;IACN,CAAC;IAED;;OAEG;IACK,UAAU;QACd,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,4CAA4C;QAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;YAE3C,mCAAmC;YACnC,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;gBACjC,UAAU,IAAI,MAAM,CAAC;gBACrB,MAAM,EAAE,CAAC;YACb,CAAC;YAED,mDAAmD;YACnD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;gBACzB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACjE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;wBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;wBACnD,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;wBACjC,UAAU,IAAI,MAAM,CAAC;wBACrB,MAAM,EAAE,CAAC;oBACb,CAAC;gBACL,CAAC;YACL,CAAC;YAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;YAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YACnD,IAAI,CAAC,WAAW,IAAI,UAAU,CAAC;YAE/B,WAAW,EAAE,CAAC;QAClB,CAAC;QAED,0CAA0C;QAC1C,wEAAwE;QACxE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,yBAAyB;QAC7B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEjD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjD,qDAAqD;YACrD,mEAAmE;YACnE,MAAM,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YACjD,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAC3C,CAAC;QAED,kCAAkC;QAClC,OAAO,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;aACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CACtB,KAAe,EACf,OAIC;QAED,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;QACvD,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,UAAU,GAAG,IAAI,CAAC;QAEtB,OAAO,UAAU,EAAE,CAAC;YAChB,UAAU,GAAG,KAAK,CAAC;YAEnB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;gBACzB,iCAAiC;gBACjC,IAAI,WAAW,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBACzC,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;oBACpC,SAAS;gBACb,CAAC;gBAED,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3D,MAAM,mBAAmB,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;gBAEhE,sBAAsB;gBACtB,IAAI,mBAAmB,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACjC,SAAS;gBACb,CAAC;gBAED,iCAAiC;gBACjC,IAAI,aAAa,GAAG,gBAAgB,CAAC;gBACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;gBAEjB,4DAA4D;gBAC5D,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;gBAEvD,KAAK,MAAM,SAAS,IAAI,mBAAmB,EAAE,CAAC;oBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAEzE,wDAAwD;oBACxD,IAAI,IAAI,GAAG,QAAQ,GAAG,SAAS,EAAE,CAAC;wBAC9B,QAAQ,GAAG,IAAI,CAAC;wBAChB,aAAa,GAAG,SAAS,CAAC;oBAC9B,CAAC;gBACL,CAAC;gBAED,mCAAmC;gBACnC,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBACvF,IAAI,WAAW,GAAG,QAAQ,GAAG,SAAS,EAAE,CAAC;oBACrC,QAAQ,GAAG,WAAW,CAAC;oBACvB,aAAa,GAAG,gBAAgB,CAAC;gBACrC,CAAC;gBAED,6BAA6B;gBAC7B,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;gBAE/C,sBAAsB;gBACtB,IAAI,aAAa,KAAK,gBAAgB,EAAE,CAAC;oBACrC,UAAU,GAAG,IAAI,CAAC;oBAClB,WAAW,GAAG,IAAI,CAAC;gBACvB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACK,UAAU,CAAC,MAAc;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjD,OAAO,MAAM,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACK,oBAAoB,CAAC,SAAiB,EAAE,aAAqB;QACjE,gDAAgD;QAChD,2DAA2D;QAC3D,OAAO,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACK,uBAAuB,CAAC,MAAc,EAAE,eAAuB,EAAE,UAAkB;QACvF,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAErD,+CAA+C;QAC/C,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YAC9D,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,eAAe,EAAE,CAAC;gBACrD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAClD,cAAc,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;YACxC,CAAC;QACL,CAAC;QAED,mDAAmD;QACnD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACzB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAChE,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,eAAe,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC9F,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;oBAClD,cAAc,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;gBACxC,CAAC;YACL,CAAC;QACL,CAAC;QAED,6BAA6B;QAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAErE,0BAA0B;QAC1B,MAAM,IAAI,GACN,CAAC,cAAc,GAAG,CAAC,UAAU,GAAG,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAE5G,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,uBAAuB,CAAC,MAAc,EAAE,SAAiB;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QAC/F,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACK,kBAAkB,CAAC,MAAc,EAAE,SAAiB;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QAC/F,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACK,sBAAsB,CAAC,MAAc;QACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QAEtC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC1B,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,mDAAmD;QACnD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACzB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;oBAC1B,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC/B,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CAAC,UAAkB;QAC1C,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,CAAC,CAAC;QACb,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,2BAA2B;QAC3B,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3D,gDAAgD;QAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAEpD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC9D,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;oBAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;oBAClD,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;oBACjC,wBAAwB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBACrG,CAAC;YACL,CAAC;QACL,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,IAAI,wBAAwB,EAAE,CAAC;YACjE,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClE,4DAA4D;YAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC;YACxE,MAAM,MAAM,GAAG,eAAe,CAAC;YAE/B,sFAAsF;YACtF,MAAM,cAAc,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;YAC9C,MAAM,gBAAgB,GAAG,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;YACnF,UAAU,IAAI,cAAc,GAAG,gBAAgB,CAAC;QACpD,CAAC;QAED,OAAO,UAAU,CAAC;IACtB,CAAC;IAED;;;OAGG;IACI,eAAe;QAClB,OAAO,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;IACpC,CAAC;CACJ;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY,EAAE,UAAmC,EAAE;IAChF,MAAM,SAAS,GAAG,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC9C,OAAO,SAAS,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;AAChD,CAAC"}

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

@@ -8,9 +8,8 @@ import type { CommunityResult, LouvainOptions } from "../../types/index.js";
  *
  * References:
  * - Blondel, V. D., Guillaume, J. L., Lambiotte, R., & Lefebvre, E. (2008).
- *   Fast unfolding of communities in large networks.
- *   Journal of statistical mechanics: theory and experiment, 2008(10), P10008.
- *
+ * Fast unfolding of communities in large networks.
+ * Journal of statistical mechanics: theory and experiment, 2008(10), P10008.
  * @param graph - The input graph
  * @param options - Algorithm options
  * @returns Community detection result with communities, modularity, and iterations

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

@@ -1 +1 @@
-{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/community/louvain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAC1C,OAAO,KAAK,EAAC,eAAe,EAAE,cAAc,EAAS,MAAM,sBAAsB,CAAC;AAElF;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,OAAO,CACnB,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,cAAmB,GAC7B,eAAe,CAiCjB"}
+{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/community/louvain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAU,MAAM,sBAAsB,CAAC;AAIpF;;;;;;;;;;;;;GAaG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,cAAmB,GAAG,eAAe,CAkDnF"}