@graphty/algorithms 1.2.0 → 1.4.2

package/dist/src/algorithms/centrality/delta-pagerank-simple.js

@@ -0,0 +1,304 @@
+/**
+ * Simplified Delta-based PageRank that matches the standard algorithm
+ * but only processes active nodes for efficiency.
+ *
+ * Key optimization: Supports incremental updates when graph structure changes,
+ * avoiding full recomputation from scratch.
+ */
+export class SimpleDeltaPageRank {
+    /**
+     * Creates a new SimpleDeltaPageRank instance for the given graph.
+     * @param graph - The directed graph to compute PageRank on
+     */
+    constructor(graph) {
+        this.previousScores = null;
+        if (!graph.isDirected) {
+            throw new Error("PageRank requires a directed graph");
+        }
+        this.graph = graph;
+        this.nodeCount = graph.nodeCount;
+    }
+    /**
+     * Computes PageRank scores for all nodes in the graph using power iteration.
+     * @param options - Configuration options for PageRank computation
+     * @param options.dampingFactor - Probability of following a link (default: 0.85)
+     * @param options.tolerance - Convergence tolerance threshold (default: 1e-6)
+     * @param options.maxIterations - Maximum number of iterations (default: 100)
+     * @param options.personalization - Personalization vector for Personalized PageRank
+     * @param options.weight - Edge attribute name for weighted PageRank
+     * @returns Map of node IDs to their PageRank scores
+     */
+    compute(options = {}) {
+        const { dampingFactor = 0.85, tolerance = 1e-6, maxIterations = 100, personalization, weight } = options;
+        if (this.nodeCount === 0) {
+            return new Map();
+        }
+        // Initialize scores
+        const scores = new Map();
+        const newScores = new Map();
+        for (const node of this.graph.nodes()) {
+            scores.set(node.id, 1.0 / this.nodeCount);
+        }
+        // Precompute out-degrees and weights
+        const outWeights = new Map();
+        const danglingNodes = new Set();
+        for (const node of this.graph.nodes()) {
+            let totalWeight = 0;
+            let outDegree = 0;
+            for (const neighbor of Array.from(this.graph.neighbors(node.id))) {
+                outDegree++;
+                const edge = this.graph.getEdge(node.id, neighbor);
+                totalWeight += edge?.weight ?? 1;
+            }
+            outWeights.set(node.id, totalWeight);
+            if (outDegree === 0) {
+                danglingNodes.add(node.id);
+            }
+        }
+        // Normalize personalization vector if provided
+        let personalVector = null;
+        if (personalization) {
+            personalVector = new Map(personalization);
+            this.normalizeMap(personalVector);
+        }
+        // Power iteration with active node tracking
+        let activeNodes = new Set(scores.keys());
+        let iteration = 0;
+        for (iteration = 0; iteration < maxIterations; iteration++) {
+            // Initialize new scores
+            for (const nodeId of scores.keys()) {
+                if (personalVector) {
+                    newScores.set(nodeId, (1 - dampingFactor) * (personalVector.get(nodeId) ?? 0));
+                }
+                else {
+                    newScores.set(nodeId, (1 - dampingFactor) / this.nodeCount);
+                }
+            }
+            // Handle dangling nodes
+            let danglingSum = 0;
+            for (const danglingNode of danglingNodes) {
+                danglingSum += scores.get(danglingNode) ?? 0;
+            }
+            if (danglingSum > 0) {
+                const danglingContribution = (dampingFactor * danglingSum) / this.nodeCount;
+                for (const nodeId of scores.keys()) {
+                    const current = newScores.get(nodeId) ?? 0;
+                    if (personalVector) {
+                        const personalContrib = danglingContribution * (personalVector.get(nodeId) ?? 0);
+                        newScores.set(nodeId, current + personalContrib);
+                    }
+                    else {
+                        newScores.set(nodeId, current + danglingContribution);
+                    }
+                }
+            }
+            // Propagate rank from active nodes only
+            for (const nodeId of activeNodes) {
+                const currentRank = scores.get(nodeId) ?? 0;
+                const nodeOutWeight = outWeights.get(nodeId) ?? 0;
+                if (nodeOutWeight > 0) {
+                    for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                        let edgeWeight = 1;
+                        if (weight) {
+                            const edge = this.graph.getEdge(nodeId, neighbor);
+                            edgeWeight = edge?.weight ?? 1;
+                        }
+                        const contribution = dampingFactor * currentRank * (edgeWeight / nodeOutWeight);
+                        const neighborRank = newScores.get(neighbor) ?? 0;
+                        newScores.set(neighbor, neighborRank + contribution);
+                    }
+                }
+            }
+            // Check convergence and identify active nodes
+            const nextActive = new Set();
+            let maxDiff = 0;
+            for (const nodeId of scores.keys()) {
+                const oldRank = scores.get(nodeId) ?? 0;
+                const newRank = newScores.get(nodeId) ?? 0;
+                const diff = Math.abs(newRank - oldRank);
+                maxDiff = Math.max(maxDiff, diff);
+                // Mark as active if change is significant
+                if (diff > tolerance / 10) {
+                    nextActive.add(nodeId);
+                    // Also mark neighbors as potentially active
+                    for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                        nextActive.add(neighbor);
+                    }
+                    for (const neighbor of Array.from(this.graph.inNeighbors(nodeId))) {
+                        nextActive.add(neighbor);
+                    }
+                }
+            }
+            // Swap score maps
+            scores.clear();
+            for (const [k, v] of newScores) {
+                scores.set(k, v);
+            }
+            newScores.clear();
+            activeNodes = nextActive;
+            if (maxDiff < tolerance) {
+                break;
+            }
+        }
+        // Store scores for potential incremental updates
+        this.previousScores = new Map(scores);
+        return scores;
+    }
+    /**
+     * Perform incremental update after graph modification.
+     * This is where delta-based approach provides significant speedup.
+     * @param modifiedNodes - Set of nodes that were modified (edges added/removed)
+     * @param options - Computation options
+     * @param options.dampingFactor - Probability of following a link (default: 0.85)
+     * @param options.tolerance - Convergence tolerance threshold (default: 1e-6)
+     * @param options.maxIterations - Maximum number of iterations (default: 100)
+     * @param options.personalization - Personalization vector for Personalized PageRank
+     * @param options.weight - Edge attribute name for weighted PageRank
+     * @returns Updated PageRank scores
+     */
+    update(modifiedNodes, options = {}) {
+        if (!this.previousScores) {
+            // No previous computation, do full compute
+            return this.compute(options);
+        }
+        const { dampingFactor = 0.85, tolerance = 1e-6, maxIterations = 100, personalization, weight } = options;
+        // Initialize scores from previous computation
+        const scores = new Map(this.previousScores);
+        const newScores = new Map();
+        // Ensure all current nodes are included
+        for (const node of this.graph.nodes()) {
+            if (!scores.has(node.id)) {
+                scores.set(node.id, 1.0 / this.nodeCount);
+            }
+        }
+        // Start with only modified nodes and their neighbors as active
+        let activeNodes = new Set();
+        for (const nodeId of modifiedNodes) {
+            activeNodes.add(nodeId);
+            // Add incoming neighbors
+            for (const neighbor of Array.from(this.graph.inNeighbors(nodeId))) {
+                activeNodes.add(neighbor);
+            }
+            // Add outgoing neighbors
+            for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                activeNodes.add(neighbor);
+            }
+        }
+        // Recompute out-weights for modified nodes
+        const outWeights = new Map();
+        const danglingNodes = new Set();
+        for (const node of this.graph.nodes()) {
+            let totalWeight = 0;
+            let outDegree = 0;
+            for (const neighbor of Array.from(this.graph.neighbors(node.id))) {
+                outDegree++;
+                const edge = this.graph.getEdge(node.id, neighbor);
+                totalWeight += edge?.weight ?? 1;
+            }
+            outWeights.set(node.id, totalWeight);
+            if (outDegree === 0) {
+                danglingNodes.add(node.id);
+            }
+        }
+        // Normalize personalization vector if provided
+        let personalVector = null;
+        if (personalization) {
+            personalVector = new Map(personalization);
+            this.normalizeMap(personalVector);
+        }
+        // Run limited iterations focusing on active nodes
+        let iteration = 0;
+        for (iteration = 0; iteration < maxIterations && activeNodes.size > 0; iteration++) {
+            // Initialize new scores
+            for (const nodeId of scores.keys()) {
+                if (personalVector) {
+                    newScores.set(nodeId, (1 - dampingFactor) * (personalVector.get(nodeId) ?? 0));
+                }
+                else {
+                    newScores.set(nodeId, (1 - dampingFactor) / this.nodeCount);
+                }
+            }
+            // Handle dangling nodes
+            let danglingSum = 0;
+            for (const danglingNode of danglingNodes) {
+                danglingSum += scores.get(danglingNode) ?? 0;
+            }
+            if (danglingSum > 0) {
+                const danglingContribution = (dampingFactor * danglingSum) / this.nodeCount;
+                for (const nodeId of scores.keys()) {
+                    const current = newScores.get(nodeId) ?? 0;
+                    if (personalVector) {
+                        const personalContrib = danglingContribution * (personalVector.get(nodeId) ?? 0);
+                        newScores.set(nodeId, current + personalContrib);
+                    }
+                    else {
+                        newScores.set(nodeId, current + danglingContribution);
+                    }
+                }
+            }
+            // Propagate rank from ALL nodes (not just active)
+            // This ensures correctness
+            for (const nodeId of scores.keys()) {
+                const currentRank = scores.get(nodeId) ?? 0;
+                const nodeOutWeight = outWeights.get(nodeId) ?? 0;
+                if (nodeOutWeight > 0) {
+                    for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                        let edgeWeight = 1;
+                        if (weight) {
+                            const edge = this.graph.getEdge(nodeId, neighbor);
+                            edgeWeight = edge?.weight ?? 1;
+                        }
+                        const contribution = dampingFactor * currentRank * (edgeWeight / nodeOutWeight);
+                        const neighborRank = newScores.get(neighbor) ?? 0;
+                        newScores.set(neighbor, neighborRank + contribution);
+                    }
+                }
+            }
+            // Check convergence only for active nodes
+            const nextActive = new Set();
+            let maxDiff = 0;
+            for (const nodeId of activeNodes) {
+                const oldRank = scores.get(nodeId) ?? 0;
+                const newRank = newScores.get(nodeId) ?? 0;
+                const diff = Math.abs(newRank - oldRank);
+                maxDiff = Math.max(maxDiff, diff);
+                // Mark as active if change is significant
+                if (diff > tolerance / 10) {
+                    nextActive.add(nodeId);
+                    // Also mark neighbors as potentially active
+                    for (const neighbor of Array.from(this.graph.neighbors(nodeId))) {
+                        nextActive.add(neighbor);
+                    }
+                    for (const neighbor of Array.from(this.graph.inNeighbors(nodeId))) {
+                        nextActive.add(neighbor);
+                    }
+                }
+            }
+            // Swap score maps
+            scores.clear();
+            for (const [k, v] of newScores) {
+                scores.set(k, v);
+            }
+            newScores.clear();
+            activeNodes = nextActive;
+            if (maxDiff < tolerance) {
+                break;
+            }
+        }
+        // Store scores for future incremental updates
+        this.previousScores = new Map(scores);
+        return scores;
+    }
+    normalizeMap(map) {
+        let sum = 0;
+        for (const value of map.values()) {
+            sum += value;
+        }
+        if (sum > 0) {
+            for (const [key, value] of Array.from(map)) {
+                map.set(key, value / sum);
+            }
+        }
+    }
+}
+//# sourceMappingURL=delta-pagerank-simple.js.map

package/dist/src/algorithms/centrality/delta-pagerank-simple.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delta-pagerank-simple.js","sourceRoot":"","sources":["../../../../src/algorithms/centrality/delta-pagerank-simple.ts"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,MAAM,OAAO,mBAAmB;IAK5B;;;OAGG;IACH,YAAY,KAAY;QANhB,mBAAc,GAA+B,IAAI,CAAC;QAOtD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QAC1D,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;IACrC,CAAC;IAED;;;;;;;;;OASG;IACI,OAAO,CACV,UAMI,EAAE;QAEN,MAAM,EAAE,aAAa,GAAG,IAAI,EAAE,SAAS,GAAG,IAAI,EAAE,aAAa,GAAG,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAEzG,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,GAAG,EAAE,CAAC;QACrB,CAAC;QAED,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,qCAAqC;QACrC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/D,SAAS,EAAE,CAAC;gBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACnD,WAAW,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;YACrC,CAAC;YAED,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;YACrC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBAClB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,+CAA+C;QAC/C,IAAI,cAAc,GAA+B,IAAI,CAAC;QACtD,IAAI,eAAe,EAAE,CAAC;YAClB,cAAc,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;QACtC,CAAC;QAED,4CAA4C;QAC5C,IAAI,WAAW,GAAG,IAAI,GAAG,CAAS,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACjD,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,wBAAwB;YACxB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,IAAI,cAAc,EAAE,CAAC;oBACjB,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnF,CAAC;qBAAM,CAAC;oBACJ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChE,CAAC;YACL,CAAC;YAED,wBAAwB;YACxB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;gBACvC,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACjD,CAAC;YAED,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,oBAAoB,GAAG,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;gBAC5E,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACjC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,cAAc,EAAE,CAAC;wBACjB,MAAM,eAAe,GAAG,oBAAoB,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;wBACjF,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,eAAe,CAAC,CAAC;oBACrD,CAAC;yBAAM,CAAC;wBACJ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,oBAAoB,CAAC,CAAC;oBAC1D,CAAC;gBACL,CAAC;YACL,CAAC;YAED,wCAAwC;YACxC,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAElD,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;oBACpB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAC9D,IAAI,UAAU,GAAG,CAAC,CAAC;wBACnB,IAAI,MAAM,EAAE,CAAC;4BACT,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;4BAClD,UAAU,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;wBACnC,CAAC;wBAED,MAAM,YAAY,GAAG,aAAa,GAAG,WAAW,GAAG,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC;wBAChF,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;wBAClD,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;oBACzD,CAAC;gBACL,CAAC;YACL,CAAC;YAED,8CAA8C;YAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;YACrC,IAAI,OAAO,GAAG,CAAC,CAAC;YAEhB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACxC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAElC,0CAA0C;gBAC1C,IAAI,IAAI,GAAG,SAAS,GAAG,EAAE,EAAE,CAAC;oBACxB,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACvB,4CAA4C;oBAC5C,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAC9D,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC7B,CAAC;oBACD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAChE,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC;YACL,CAAC;YAED,kBAAkB;YAClB,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,SAAS,CAAC,KAAK,EAAE,CAAC;YAElB,WAAW,GAAG,UAAU,CAAC;YAEzB,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;gBACtB,MAAM;YACV,CAAC;QACL,CAAC;QAED,iDAAiD;QACjD,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAEtC,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CACT,aAA0B,EAC1B,UAMI,EAAE;QAEN,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACvB,2CAA2C;YAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,EAAE,aAAa,GAAG,IAAI,EAAE,SAAS,GAAG,IAAI,EAAE,aAAa,GAAG,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAEzG,8CAA8C;QAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,wCAAwC;QACxC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC;QAED,+DAA+D;QAC/D,IAAI,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACjC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxB,yBAAyB;YACzB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAChE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;YACD,yBAAyB;YACzB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC9D,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACpC,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/D,SAAS,EAAE,CAAC;gBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACnD,WAAW,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;YACrC,CAAC;YAED,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;YACrC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBAClB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,+CAA+C;QAC/C,IAAI,cAAc,GAA+B,IAAI,CAAC;QACtD,IAAI,eAAe,EAAE,CAAC;YAClB,cAAc,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;QACtC,CAAC;QAED,kDAAkD;QAClD,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACjF,wBAAwB;YACxB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,IAAI,cAAc,EAAE,CAAC;oBACjB,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnF,CAAC;qBAAM,CAAC;oBACJ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChE,CAAC;YACL,CAAC;YAED,wBAAwB;YACxB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;gBACvC,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACjD,CAAC;YAED,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,oBAAoB,GAAG,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;gBAC5E,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACjC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,cAAc,EAAE,CAAC;wBACjB,MAAM,eAAe,GAAG,oBAAoB,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;wBACjF,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,eAAe,CAAC,CAAC;oBACrD,CAAC;yBAAM,CAAC;wBACJ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,oBAAoB,CAAC,CAAC;oBAC1D,CAAC;gBACL,CAAC;YACL,CAAC;YAED,kDAAkD;YAClD,2BAA2B;YAC3B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAElD,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;oBACpB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAC9D,IAAI,UAAU,GAAG,CAAC,CAAC;wBACnB,IAAI,MAAM,EAAE,CAAC;4BACT,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;4BAClD,UAAU,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;wBACnC,CAAC;wBAED,MAAM,YAAY,GAAG,aAAa,GAAG,WAAW,GAAG,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC;wBAChF,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;wBAClD,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;oBACzD,CAAC;gBACL,CAAC;YACL,CAAC;YAED,0CAA0C;YAC1C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;YACrC,IAAI,OAAO,GAAG,CAAC,CAAC;YAEhB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACxC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAElC,0CAA0C;gBAC1C,IAAI,IAAI,GAAG,SAAS,GAAG,EAAE,EAAE,CAAC;oBACxB,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACvB,4CAA4C;oBAC5C,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAC9D,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC7B,CAAC;oBACD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;wBAChE,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC;YACL,CAAC;YAED,kBAAkB;YAClB,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,SAAS,CAAC,KAAK,EAAE,CAAC;YAElB,WAAW,GAAG,UAAU,CAAC;YAEzB,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;gBACtB,MAAM;YACV,CAAC;QACL,CAAC;QAED,8CAA8C;QAC9C,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAEtC,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,YAAY,CAAC,GAAwB;QACzC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/B,GAAG,IAAI,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;IACL,CAAC;CACJ"}

package/dist/src/algorithms/centrality/delta-pagerank.d.ts

@@ -0,0 +1,106 @@
+import type { Graph } from "../../core/graph.js";
+import type { NodeId } from "../../types/index.js";
+/**
+ * Delta-based PageRank implementation for faster convergence
+ *
+ * This algorithm tracks changes (deltas) between iterations and only processes
+ * nodes with significant changes, dramatically reducing computation for graphs
+ * where only some nodes are actively changing their PageRank values.
+ *
+ * Key optimizations:
+ * - Only active nodes (with significant deltas) are processed
+ * - Early termination for converged vertices
+ * - Priority queue processing for high-impact updates
+ * - Adaptive convergence detection per vertex
+ *
+ * Expected speedup: 10-100x for incremental updates on large graphs
+ */
+export interface DeltaPageRankOptions {
+    /**
+     * Damping factor (probability of following a link) (default: 0.85)
+     */
+    dampingFactor?: number;
+    /**
+     * Convergence tolerance (default: 1e-6)
+     */
+    tolerance?: number;
+    /**
+     * Maximum number of iterations (default: 100)
+     */
+    maxIterations?: number;
+    /**
+     * Minimum delta to keep vertex active (default: tolerance / 10)
+     */
+    deltaThreshold?: number;
+    /**
+     * Personalization vector for Personalized PageRank (default: null)
+     */
+    personalization?: Map<NodeId, number>;
+    /**
+     * Weight attribute for weighted PageRank (default: null = unweighted)
+     */
+    weight?: string;
+}
+/**
+ * Delta-based PageRank class that tracks changes between iterations
+ * and only processes nodes with significant changes for improved performance.
+ */
+export declare class DeltaPageRank {
+    private graph;
+    private scores;
+    private deltas;
+    private activeNodes;
+    private outDegrees;
+    private outWeights;
+    private danglingNodes;
+    private nodeCount;
+    /**
+     * Creates a new DeltaPageRank instance for the given graph.
+     * @param graph - The directed graph to compute PageRank on
+     */
+    constructor(graph: Graph);
+    private initialize;
+    /**
+     * Computes PageRank scores using delta-based iteration for faster convergence.
+     * @param options - Configuration options for PageRank computation
+     * @returns Map of node IDs to their PageRank scores
+     */
+    compute(options?: DeltaPageRankOptions): Map<NodeId, number>;
+    /**
+     * Update PageRank scores after graph modification.
+     * This is where delta-based approach really shines.
+     * @param modifiedNodes - Set of nodes that were modified (edges added/removed)
+     * @param options - Configuration options for PageRank computation
+     * @returns Updated PageRank scores
+     */
+    update(modifiedNodes: Set<NodeId>, options?: DeltaPageRankOptions): Map<NodeId, number>;
+    private normalizeMap;
+}
+/**
+ * Priority queue based implementation for even better performance
+ * Processes nodes in order of their delta magnitude
+ */
+export declare class PriorityDeltaPageRank {
+    private graph;
+    private scores;
+    private priorityQueue;
+    private nodeDeltas;
+    private outWeights;
+    private danglingNodes;
+    private nodeCount;
+    /**
+     * Creates a new PriorityDeltaPageRank instance for the given graph.
+     * @param graph - The directed graph to compute PageRank on
+     */
+    constructor(graph: Graph);
+    private initialize;
+    /**
+     * Computes PageRank scores using priority queue-based delta iteration.
+     * Processes nodes in order of their delta magnitude for optimal convergence.
+     * @param options - Configuration options for PageRank computation
+     * @returns Map of node IDs to their PageRank scores
+     */
+    computeWithPriority(options?: DeltaPageRankOptions): Map<NodeId, number>;
+    private normalizeMap;
+}
+//# sourceMappingURL=delta-pagerank.d.ts.map

package/dist/src/algorithms/centrality/delta-pagerank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"delta-pagerank.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/centrality/delta-pagerank.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAEnD;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,oBAAoB;IACjC;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;OAEG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;OAEG;IACH,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,qBAAa,aAAa;IACtB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,WAAW,CAAc;IACjC,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,aAAa,CAAc;IACnC,OAAO,CAAC,SAAS,CAAS;IAE1B;;;OAGG;gBACS,KAAK,EAAE,KAAK;IAiBxB,OAAO,CAAC,UAAU;IA6BlB;;;;OAIG;IACI,OAAO,CAAC,OAAO,GAAE,oBAAyB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAiIvE;;;;;;OAMG;IACI,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,GAAE,oBAAyB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAsBlG,OAAO,CAAC,YAAY;CAYvB;AAED;;;GAGG;AACH,qBAAa,qBAAqB;IAC9B,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,aAAa,CAAwB;IAC7C,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,aAAa,CAAc;IACnC,OAAO,CAAC,SAAS,CAAS;IAE1B;;;OAGG;gBACS,KAAK,EAAE,KAAK;IAkBxB,OAAO,CAAC,UAAU;IA4BlB;;;;;OAKG;IACI,mBAAmB,CAAC,OAAO,GAAE,oBAAyB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAwFnF,OAAO,CAAC,YAAY;CAYvB"}