@graphty/algorithms 1.0.1 → 1.1.0

package/dist/src/flow/min-cut.js

@@ -0,0 +1,383 @@
+/**
+ * Minimum Cut Algorithms
+ *
+ * Various algorithms for finding minimum cuts in graphs
+ */
+import { fordFulkerson } from "./ford-fulkerson.js";
+/**
+ * Find minimum s-t cut using max flow
+ * The minimum cut value equals the maximum flow value (max-flow min-cut theorem)
+ *
+ * @param graph - Weighted graph
+ * @param source - Source node
+ * @param sink - Sink node
+ * @returns Minimum cut information
+ *
+ * Time Complexity: Same as max flow algorithm used
+ */
+export function minSTCut(graph, source, sink) {
+    const flowResult = fordFulkerson(graph, source, sink);
+    if (!flowResult.minCut) {
+        return {
+            cutValue: 0,
+            partition1: new Set(),
+            partition2: new Set(),
+            cutEdges: [],
+        };
+    }
+    const cutEdges = [];
+    // Find actual cut edges and their weights
+    for (const [u, v] of flowResult.minCut.edges) {
+        const weight = graph.get(u)?.get(v) ?? 0;
+        if (weight > 0) {
+            cutEdges.push({ from: u, to: v, weight });
+        }
+    }
+    return {
+        cutValue: flowResult.maxFlow,
+        partition1: flowResult.minCut.source,
+        partition2: flowResult.minCut.sink,
+        cutEdges,
+    };
+}
+/**
+ * Stoer-Wagner algorithm for finding global minimum cut
+ * Finds the minimum cut that separates the graph into two parts
+ *
+ * @param graph - Undirected weighted graph
+ * @returns Global minimum cut
+ *
+ * Time Complexity: O(V³) or O(VE + V² log V) with heap
+ */
+export function stoerWagner(graph) {
+    // Convert to undirected if necessary
+    const undirectedGraph = makeUndirected(graph);
+    if (undirectedGraph.size < 2) {
+        return {
+            cutValue: 0,
+            partition1: new Set(undirectedGraph.keys()),
+            partition2: new Set(),
+            cutEdges: [],
+        };
+    }
+    // Initialize
+    const nodes = Array.from(undirectedGraph.keys());
+    let minCutValue = Infinity;
+    let bestPartition = new Set();
+    const contractionMap = new Map();
+    // Initialize contraction map
+    for (const node of nodes) {
+        contractionMap.set(node, new Set([node]));
+    }
+    // Contract graph V-1 times
+    while (nodes.length > 1) {
+        const cut = minimumCutPhase(undirectedGraph, nodes);
+        if (cut.value < minCutValue) {
+            minCutValue = cut.value;
+            // Store the actual nodes that would be in partition with t
+            const cutTNodes = contractionMap.get(cut.t);
+            if (cutTNodes) {
+                bestPartition = new Set(cutTNodes);
+            }
+        }
+        // Contract the last two nodes
+        const tNodes = contractionMap.get(cut.t);
+        const sNodes = contractionMap.get(cut.s);
+        if (!tNodes || !sNodes) {
+            continue;
+        }
+        for (const node of tNodes) {
+            sNodes.add(node);
+        }
+        contractionMap.delete(cut.t);
+        contractNodes(undirectedGraph, nodes, cut.s, cut.t);
+    }
+    // Build result
+    const partition1 = bestPartition;
+    const partition2 = new Set();
+    for (const node of graph.keys()) {
+        if (!partition1.has(node)) {
+            partition2.add(node);
+        }
+    }
+    // Find cut edges
+    const cutEdges = [];
+    for (const u of partition1) {
+        const neighbors = graph.get(u);
+        if (neighbors) {
+            for (const [v, weight] of neighbors) {
+                if (partition2.has(v)) {
+                    cutEdges.push({ from: u, to: v, weight });
+                }
+            }
+        }
+    }
+    return {
+        cutValue: minCutValue,
+        partition1,
+        partition2,
+        cutEdges,
+    };
+}
+/**
+ * Minimum cut phase of Stoer-Wagner algorithm
+ */
+function minimumCutPhase(graph, nodes) {
+    const n = nodes.length;
+    const weight = new Map();
+    const added = new Set();
+    const order = [];
+    // Initialize weights to 0
+    for (const node of nodes) {
+        weight.set(node, 0);
+    }
+    // Start with arbitrary node
+    let lastAdded = nodes[0];
+    if (!lastAdded) {
+        return { s: "", t: "", value: 0, partition: [] };
+    }
+    added.add(lastAdded);
+    order.push(lastAdded);
+    // Add remaining nodes
+    for (let i = 1; i < n; i++) {
+        // Update weights
+        if (!lastAdded) {
+            continue;
+        }
+        const neighbors = graph.get(lastAdded);
+        if (neighbors) {
+            for (const [neighbor, w] of neighbors) {
+                if (!added.has(neighbor) && nodes.includes(neighbor)) {
+                    const currentWeight = weight.get(neighbor);
+                    if (currentWeight !== undefined) {
+                        weight.set(neighbor, currentWeight + w);
+                    }
+                }
+            }
+        }
+        // Find maximum weight node not yet added
+        let maxWeight = -1;
+        let maxNode = "";
+        for (const node of nodes) {
+            const nodeWeight = weight.get(node);
+            if (!added.has(node) && nodeWeight !== undefined && nodeWeight > maxWeight) {
+                maxWeight = nodeWeight;
+                maxNode = node;
+            }
+        }
+        added.add(maxNode);
+        order.push(maxNode);
+        lastAdded = maxNode;
+    }
+    const s = order[order.length - 2];
+    const t = order[order.length - 1];
+    if (!s || !t) {
+        return { s: "", t: "", value: 0, partition: [] };
+    }
+    const cutValue = weight.get(t) ?? 0;
+    // Partition is all nodes except t
+    const partition = order.slice(0, -1);
+    return { s, t, value: cutValue, partition };
+}
+/**
+ * Contract two nodes in the graph
+ */
+function contractNodes(graph, nodes, s, t) {
+    // Merge t into s
+    const sNeighbors = graph.get(s);
+    const tNeighbors = graph.get(t);
+    if (!sNeighbors || !tNeighbors) {
+        return;
+    }
+    // Add t's edges to s
+    for (const [neighbor, weight] of tNeighbors) {
+        if (neighbor !== s) {
+            sNeighbors.set(neighbor, (sNeighbors.get(neighbor) ?? 0) + weight);
+            // Update neighbor's edge to point to s instead of t
+            const neighborEdges = graph.get(neighbor);
+            if (neighborEdges?.has(t)) {
+                neighborEdges.delete(t);
+                neighborEdges.set(s, (neighborEdges.get(s) ?? 0) + weight);
+            }
+        }
+    }
+    // Remove t from graph
+    graph.delete(t);
+    sNeighbors.delete(t);
+    // Remove t from nodes array
+    const index = nodes.indexOf(t);
+    if (index > -1) {
+        nodes.splice(index, 1);
+    }
+}
+/**
+ * Convert directed graph to undirected
+ */
+function makeUndirected(graph) {
+    const undirected = new Map();
+    // Initialize all nodes
+    for (const node of graph.keys()) {
+        undirected.set(node, new Map());
+    }
+    // Add edges in both directions
+    for (const [u, neighbors] of graph) {
+        for (const [v, weight] of neighbors) {
+            const uNeighbors = undirected.get(u);
+            if (uNeighbors) {
+                uNeighbors.set(v, weight);
+            }
+            if (!undirected.has(v)) {
+                undirected.set(v, new Map());
+            }
+            const vNeighbors = undirected.get(v);
+            if (vNeighbors) {
+                vNeighbors.set(u, weight);
+            }
+        }
+    }
+    return undirected;
+}
+/**
+ * Karger's randomized min-cut algorithm
+ * Probabilistic algorithm that finds min cut with high probability
+ *
+ * @param graph - Undirected graph
+ * @param iterations - Number of iterations (higher = better accuracy)
+ * @returns Minimum cut found
+ *
+ * Time Complexity: O(V² * iterations)
+ */
+export function kargerMinCut(graph, iterations = 100) {
+    let minCutValue = Infinity;
+    let bestPartition1 = new Set();
+    let bestPartition2 = new Set();
+    for (let i = 0; i < iterations; i++) {
+        const result = kargerSingleRun(graph);
+        if (result.cutValue < minCutValue) {
+            minCutValue = result.cutValue;
+            bestPartition1 = result.partition1;
+            bestPartition2 = result.partition2;
+        }
+    }
+    // Find cut edges
+    const cutEdges = [];
+    for (const u of bestPartition1) {
+        const neighbors = graph.get(u);
+        if (neighbors) {
+            for (const [v, weight] of neighbors) {
+                if (bestPartition2.has(v)) {
+                    cutEdges.push({ from: u, to: v, weight });
+                }
+            }
+        }
+    }
+    return {
+        cutValue: minCutValue,
+        partition1: bestPartition1,
+        partition2: bestPartition2,
+        cutEdges,
+    };
+}
+/**
+ * Single run of Karger's algorithm
+ */
+function kargerSingleRun(graph) {
+    // Create a copy of the graph
+    const workGraph = new Map();
+    const superNodes = new Map();
+    // Initialize
+    for (const [node, neighbors] of graph) {
+        workGraph.set(node, new Map(neighbors));
+        superNodes.set(node, new Set([node]));
+    }
+    // Contract until 2 nodes remain
+    while (workGraph.size > 2) {
+        // Pick random edge
+        const edges = [];
+        for (const [u, neighbors] of workGraph) {
+            for (const [v, weight] of neighbors) {
+                if (u < v) { // Avoid duplicates
+                    edges.push([u, v, weight]);
+                }
+            }
+        }
+        if (edges.length === 0) {
+            break;
+        }
+        const randomIndex = Math.floor(Math.random() * edges.length);
+        const edge = edges[randomIndex];
+        if (!edge) {
+            continue;
+        }
+        const [u, v] = edge;
+        // Contract edge
+        if (u && v) {
+            contractKarger(workGraph, superNodes, u, v);
+        }
+    }
+    // Calculate cut value
+    const nodes = Array.from(workGraph.keys());
+    if (nodes.length < 2) {
+        return {
+            cutValue: 0,
+            partition1: new Set(),
+            partition2: new Set(),
+        };
+    }
+    const node1 = nodes[0];
+    const node2 = nodes[1];
+    if (!node1 || !node2) {
+        return {
+            cutValue: 0,
+            partition1: new Set(),
+            partition2: new Set(),
+        };
+    }
+    const cutValue = workGraph.get(node1)?.get(node2) ?? 0;
+    return {
+        cutValue,
+        partition1: superNodes.get(node1) ?? new Set(),
+        partition2: superNodes.get(node2) ?? new Set(),
+    };
+}
+/**
+ * Contract edge in Karger's algorithm
+ */
+function contractKarger(graph, superNodes, u, v) {
+    // Merge v into u
+    const uNeighbors = graph.get(u);
+    const vNeighbors = graph.get(v);
+    if (!uNeighbors || !vNeighbors) {
+        return;
+    }
+    // Merge supernodes
+    const uSuper = superNodes.get(u);
+    const vSuper = superNodes.get(v);
+    if (!uSuper || !vSuper) {
+        return;
+    }
+    for (const node of vSuper) {
+        uSuper.add(node);
+    }
+    // Merge edges
+    for (const [neighbor, weight] of vNeighbors) {
+        if (neighbor !== u) {
+            uNeighbors.set(neighbor, (uNeighbors.get(neighbor) ?? 0) + weight);
+            // Update neighbor's edges
+            const neighborEdges = graph.get(neighbor);
+            if (neighborEdges) {
+                neighborEdges.delete(v);
+                if (neighbor !== u) {
+                    neighborEdges.set(u, (neighborEdges.get(u) ?? 0) + weight);
+                }
+            }
+        }
+    }
+    // Remove self-loops
+    uNeighbors.delete(u);
+    uNeighbors.delete(v);
+    // Remove v
+    graph.delete(v);
+    superNodes.delete(v);
+}
+//# sourceMappingURL=min-cut.js.map

package/dist/src/flow/min-cut.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-cut.js","sourceRoot":"","sources":["../../../src/flow/min-cut.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAC,aAAa,EAAC,MAAM,qBAAqB,CAAC;AASlD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CACpB,KAAuC,EACvC,MAAc,EACd,IAAY;IAEZ,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAEtD,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACrB,OAAO;YACH,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,QAAQ,EAAE,EAAE;SACf,CAAC;IACN,CAAC;IAED,MAAM,QAAQ,GAAiD,EAAE,CAAC;IAElE,0CAA0C;IAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAC,CAAC,CAAC;QAC5C,CAAC;IACL,CAAC;IAED,OAAO;QACH,QAAQ,EAAE,UAAU,CAAC,OAAO;QAC5B,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM;QACpC,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC,IAAI;QAClC,QAAQ;KACX,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CACvB,KAAuC;IAEvC,qCAAqC;IACrC,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAE9C,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO;YACH,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC3C,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,QAAQ,EAAE,EAAE;SACf,CAAC;IACN,CAAC;IAED,aAAa;IACb,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,IAAI,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEtD,6BAA6B;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,2BAA2B;IAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,eAAe,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;QAEpD,IAAI,GAAG,CAAC,KAAK,GAAG,WAAW,EAAE,CAAC;YAC1B,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,2DAA2D;YAC3D,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAI,SAAS,EAAE,CAAC;gBACZ,aAAa,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;YACvC,CAAC;QACL,CAAC;QAED,8BAA8B;QAC9B,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,SAAS;QACb,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE7B,aAAa,CAAC,eAAe,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,eAAe;IACf,MAAM,UAAU,GAAG,aAAa,CAAC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,iBAAiB;IACjB,MAAM,QAAQ,GAAiD,EAAE,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAClC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,QAAQ,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAC,CAAC,CAAC;gBAC5C,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,QAAQ,EAAE,WAAW;QACrB,UAAU;QACV,UAAU;QACV,QAAQ;KACX,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACpB,KAAuC,EACvC,KAAe;IAEf,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,0BAA0B;IAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,4BAA4B;IAC5B,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,CAAC,SAAS,EAAE,CAAC;QACb,OAAO,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAC,CAAC;IACnD,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACrB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEtB,sBAAsB;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,iBAAiB;QACb,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACvC,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBACpC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACnD,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC3C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;wBAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;oBAC5C,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,yCAAyC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,OAAO,GAAG,EAAE,CAAC;QAEjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;gBACzE,SAAS,GAAG,UAAU,CAAC;gBACvB,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,SAAS,GAAG,OAAO,CAAC;IACxB,CAAC;IAED,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACX,OAAO,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAC,CAAC;IACnD,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEpC,kCAAkC;IAClC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAErC,OAAO,EAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAClB,KAAuC,EACvC,KAAe,EACf,CAAS,EACT,CAAS;IAET,iBAAiB;IACjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;QAC7B,OAAO;IACX,CAAC;IAED,qBAAqB;IACrB,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC1C,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjB,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAEnE,oDAAoD;YACpD,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxB,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAC/D,CAAC;QACL,CAAC;IACL,CAAC;IAED,sBAAsB;IACtB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAErB,4BAA4B;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QACb,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACnB,KAAuC;IAEvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE1D,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,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,KAAK,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,UAAU,EAAE,CAAC;gBACb,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9B,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,EAAE,MAAM,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CACxB,KAAuC,EACvC,UAAU,GAAG,GAAG;IAEhB,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,IAAI,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,IAAI,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,IAAI,MAAM,CAAC,QAAQ,GAAG,WAAW,EAAE,CAAC;YAChC,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC9B,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC;YACnC,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC;QACvC,CAAC;IACL,CAAC;IAED,iBAAiB;IACjB,MAAM,QAAQ,GAAiD,EAAE,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAClC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACxB,QAAQ,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAC,CAAC,CAAC;gBAC5C,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,QAAQ,EAAE,WAAW;QACrB,UAAU,EAAE,cAAc;QAC1B,UAAU,EAAE,cAAc;QAC1B,QAAQ;KACX,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACpB,KAAuC;IAEvC,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAElD,aAAa;IACb,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,KAAK,EAAE,CAAC;QACpC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACxC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,gCAAgC;IAChC,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC5B,mBAAmB;QACf,MAAM,KAAK,GAA+B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAClC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB;oBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM;QACV,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,SAAS;QACb,CAAC;QAED,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAEpB,gBAAgB;QAChB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACT,cAAc,CAAC,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC;IACL,CAAC;IAED,sBAAsB;IACtB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnB,OAAO;YACH,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,UAAU,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC;IACN,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QACnB,OAAO;YACH,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,UAAU,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC;IACN,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEvD,OAAO;QACH,QAAQ;QACR,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE;QAC9C,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE;KACjD,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACnB,KAAuC,EACvC,UAAoC,EACpC,CAAS,EACT,CAAS;IAET,iBAAiB;IACjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;QAC7B,OAAO;IACX,CAAC;IAED,mBAAmB;IACnB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;QACrB,OAAO;IACX,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,cAAc;IACd,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC1C,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACjB,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAEnE,0BAA0B;YAC1B,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,aAAa,EAAE,CAAC;gBAChB,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACjB,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,oBAAoB;IACpB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAErB,WAAW;IACX,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC"}

package/dist/src/index.d.ts

@@ -5,7 +5,7 @@
  * optimized for browser environments and visualization applications.
  */
 export { Graph } from "./core/graph.js";
-export type { BellmanFordResult, CentralityOptions, CentralityResult, CommunityResult, ComponentResult, DijkstraOptions, Edge, GirvanNewmanOptions, GraphConfig, LouvainOptions, Node, NodeId, PageRankOptions, ShortestPathResult, TraversalOptions, TraversalResult, } from "./types/index.js";
+export type { BellmanFordResult, CentralityOptions, CentralityResult, CommunityResult, ComponentResult, DijkstraOptions, Edge, FloydWarshallResult, GirvanNewmanOptions, GraphConfig, LouvainOptions, MSTResult, Node, NodeId, PageRankOptions, ShortestPathResult, TraversalOptions, TraversalResult, } from "./types/index.js";
 export * from "./algorithms/index.js";
 export * from "./data-structures/index.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAGtC,YAAY,EACR,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,eAAe,EACf,eAAe,EACf,IAAI,EACJ,mBAAmB,EACnB,WAAW,EACX,cAAc,EACd,IAAI,EACJ,MAAM,EACN,eAAe,EACf,kBAAkB,EAClB,gBAAgB,EAChB,eAAe,GAClB,MAAM,kBAAkB,CAAC;AAG1B,cAAc,uBAAuB,CAAC;AAGtC,cAAc,4BAA4B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAGtC,YAAY,EACR,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,eAAe,EACf,eAAe,EACf,IAAI,EACJ,mBAAmB,EACnB,mBAAmB,EACnB,WAAW,EACX,cAAc,EACd,SAAS,EACT,IAAI,EACJ,MAAM,EACN,eAAe,EACf,kBAAkB,EAClB,gBAAgB,EAChB,eAAe,GAClB,MAAM,kBAAkB,CAAC;AAG1B,cAAc,uBAAuB,CAAC;AAGtC,cAAc,4BAA4B,CAAC"}

package/dist/src/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,eAAe;AACf,OAAO,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAsBtC,oBAAoB;AACpB,cAAc,uBAAuB,CAAC;AAEtC,yBAAyB;AACzB,cAAc,4BAA4B,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,eAAe;AACf,OAAO,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAwBtC,oBAAoB;AACpB,cAAc,uBAAuB,CAAC;AAEtC,yBAAyB;AACzB,cAAc,4BAA4B,CAAC"}

package/dist/src/link-prediction/adamic-adar.d.ts

@@ -0,0 +1,56 @@
+import type { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+import type { LinkPredictionOptions, LinkPredictionScore } from "./common-neighbors.js";
+/**
+ * Adamic-Adar Index link prediction implementation
+ *
+ * Predicts the likelihood of a link between two nodes based on their common
+ * neighbors, weighted by the inverse logarithm of the neighbors' degrees.
+ * This gives higher weight to rare common neighbors.
+ *
+ * Formula: AA(x,y) = Σ (1 / log(|Γ(z)|)) for all z ∈ Γ(x) ∩ Γ(y)
+ * where Γ(z) is the set of neighbors of node z
+ *
+ * Time complexity: O(k²) where k is the average degree
+ * Space complexity: O(k)
+ */
+/**
+ * Calculate Adamic-Adar index for a pair of nodes
+ */
+export declare function adamicAdarScore(graph: Graph, source: NodeId, target: NodeId, options?: LinkPredictionOptions): number;
+/**
+ * Calculate Adamic-Adar scores for all possible node pairs
+ */
+export declare function adamicAdarPrediction(graph: Graph, options?: LinkPredictionOptions): LinkPredictionScore[];
+/**
+ * Calculate Adamic-Adar scores for specific node pairs
+ */
+export declare function adamicAdarForPairs(graph: Graph, pairs: [NodeId, NodeId][], options?: LinkPredictionOptions): LinkPredictionScore[];
+/**
+ * Get top Adamic-Adar candidates for link prediction for a specific node
+ */
+export declare function getTopAdamicAdarCandidatesForNode(graph: Graph, node: NodeId, options?: LinkPredictionOptions & {
+    candidates?: NodeId[];
+}): LinkPredictionScore[];
+/**
+ * Calculate precision and recall for Adamic-Adar link prediction evaluation
+ */
+export declare function evaluateAdamicAdar(trainingGraph: Graph, testEdges: [NodeId, NodeId][], nonEdges: [NodeId, NodeId][], options?: LinkPredictionOptions): {
+    precision: number;
+    recall: number;
+    f1Score: number;
+    auc: number;
+};
+/**
+ * Compare Adamic-Adar with Common Neighbors for the same dataset
+ */
+export declare function compareAdamicAdarWithCommonNeighbors(graph: Graph, testEdges: [NodeId, NodeId][], nonEdges: [NodeId, NodeId][], options?: LinkPredictionOptions): {
+    adamicAdar: ReturnType<typeof evaluateAdamicAdar>;
+    commonNeighbors: {
+        precision: number;
+        recall: number;
+        f1Score: number;
+        auc: number;
+    };
+};
+//# sourceMappingURL=adamic-adar.d.ts.map

package/dist/src/link-prediction/adamic-adar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adamic-adar.d.ts","sourceRoot":"","sources":["../../../src/link-prediction/adamic-adar.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AAC5C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAC9C,OAAO,KAAK,EAAC,qBAAqB,EAAE,mBAAmB,EAAC,MAAM,uBAAuB,CAAC;AAEtF;;;;;;;;;;;;GAYG;AAEH;;GAEG;AACH,wBAAgB,eAAe,CAC3B,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,qBAA0B,GACpC,MAAM,CAiCR;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,qBAA0B,GACpC,mBAAmB,EAAE,CA8CvB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAC9B,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EACzB,OAAO,GAAE,qBAA0B,GACpC,mBAAmB,EAAE,CAMvB;AAED;;GAEG;AACH,wBAAgB,iCAAiC,CAC7C,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,qBAAqB,GAAG;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CAAM,GAC9D,mBAAmB,EAAE,CAoCvB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAC9B,aAAa,EAAE,KAAK,EACpB,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAC7B,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAC5B,OAAO,GAAE,qBAA0B,GACpC;IACK,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;CACf,CAgEJ;AAED;;GAEG;AACH,wBAAgB,oCAAoC,CAChD,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAC7B,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAC5B,OAAO,GAAE,qBAA0B,GACpC;IACK,UAAU,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC;IAClD,eAAe,EAAE;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,GAAG,EAAE,MAAM,CAAC;KACf,CAAC;CACL,CAkFJ"}