@optave/codegraph 3.3.1 → 3.4.1

package/dist/graph/algorithms/leiden/partition.js

@@ -0,0 +1,433 @@
+/**
+ * Mutable community assignment with per-community aggregates.
+ * Vendored from ngraph.leiden (MIT) — no external dependencies.
+ *
+ * Maintains per-community totals and per-move scratch accumulators so we can
+ * compute modularity/CPM gains in O(neighborhood) time without rescanning the
+ * whole graph after each move.
+ */
+// Typed arrays always return a number for in-bounds access, but noUncheckedIndexedAccess
+// widens to `number | undefined`. These helpers keep the compound assignment patterns readable.
+function fget(a, i) {
+    return a[i];
+}
+function iget(a, i) {
+    return a[i];
+}
+function u8get(a, i) {
+    return a[i];
+}
+export function makePartition(graph) {
+    const n = graph.n;
+    const nodeCommunity = new Int32Array(n);
+    for (let i = 0; i < n; i++)
+        nodeCommunity[i] = i;
+    let communityCount = n;
+    let communityTotalSize = new Float64Array(communityCount);
+    let communityNodeCount = new Int32Array(communityCount);
+    let communityInternalEdgeWeight = new Float64Array(communityCount);
+    let communityTotalStrength = new Float64Array(communityCount);
+    let communityTotalOutStrength = new Float64Array(communityCount);
+    let communityTotalInStrength = new Float64Array(communityCount);
+    const candidateCommunities = new Int32Array(n);
+    let candidateCommunityCount = 0;
+    const neighborEdgeWeightToCommunity = new Float64Array(n);
+    const outEdgeWeightToCommunity = new Float64Array(n);
+    const inEdgeWeightFromCommunity = new Float64Array(n);
+    const isCandidateCommunity = new Uint8Array(n);
+    function ensureCommCapacity(newCount) {
+        if (newCount <= communityTotalSize.length)
+            return;
+        const growTo = Math.max(newCount, Math.ceil(communityTotalSize.length * 1.5));
+        communityTotalSize = growFloat(communityTotalSize, growTo);
+        communityNodeCount = growInt(communityNodeCount, growTo);
+        communityInternalEdgeWeight = growFloat(communityInternalEdgeWeight, growTo);
+        communityTotalStrength = growFloat(communityTotalStrength, growTo);
+        communityTotalOutStrength = growFloat(communityTotalOutStrength, growTo);
+        communityTotalInStrength = growFloat(communityTotalInStrength, growTo);
+    }
+    function initializeAggregates() {
+        communityTotalSize.fill(0);
+        communityNodeCount.fill(0);
+        communityInternalEdgeWeight.fill(0);
+        communityTotalStrength.fill(0);
+        communityTotalOutStrength.fill(0);
+        communityTotalInStrength.fill(0);
+        for (let i = 0; i < n; i++) {
+            const c = iget(nodeCommunity, i);
+            communityTotalSize[c] = fget(communityTotalSize, c) + fget(graph.size, i);
+            communityNodeCount[c] = iget(communityNodeCount, c) + 1;
+            if (graph.directed) {
+                communityTotalOutStrength[c] =
+                    fget(communityTotalOutStrength, c) + fget(graph.strengthOut, i);
+                communityTotalInStrength[c] = fget(communityTotalInStrength, c) + fget(graph.strengthIn, i);
+            }
+            else {
+                communityTotalStrength[c] = fget(communityTotalStrength, c) + fget(graph.strengthOut, i);
+            }
+            if (fget(graph.selfLoop, i) !== 0)
+                communityInternalEdgeWeight[c] =
+                    fget(communityInternalEdgeWeight, c) + fget(graph.selfLoop, i);
+        }
+        if (graph.directed) {
+            for (let i = 0; i < n; i++) {
+                const ci = iget(nodeCommunity, i);
+                const neighbors = graph.outEdges[i];
+                for (let k = 0; k < neighbors.length; k++) {
+                    const { to: j, w } = neighbors[k];
+                    if (i === j)
+                        continue; // self-loop already counted via graph.selfLoop[i]
+                    if (ci === iget(nodeCommunity, j))
+                        communityInternalEdgeWeight[ci] = fget(communityInternalEdgeWeight, ci) + w;
+                }
+            }
+        }
+        else {
+            for (let i = 0; i < n; i++) {
+                const ci = iget(nodeCommunity, i);
+                const neighbors = graph.outEdges[i];
+                for (let k = 0; k < neighbors.length; k++) {
+                    const { to: j, w } = neighbors[k];
+                    if (j <= i)
+                        continue;
+                    if (ci === iget(nodeCommunity, j))
+                        communityInternalEdgeWeight[ci] = fget(communityInternalEdgeWeight, ci) + w;
+                }
+            }
+        }
+    }
+    function resetScratch() {
+        for (let i = 0; i < candidateCommunityCount; i++) {
+            const c = iget(candidateCommunities, i);
+            isCandidateCommunity[c] = 0;
+            neighborEdgeWeightToCommunity[c] = 0;
+            outEdgeWeightToCommunity[c] = 0;
+            inEdgeWeightFromCommunity[c] = 0;
+        }
+        candidateCommunityCount = 0;
+    }
+    function touch(c) {
+        if (u8get(isCandidateCommunity, c))
+            return;
+        isCandidateCommunity[c] = 1;
+        candidateCommunities[candidateCommunityCount++] = c;
+    }
+    function accumulateNeighborCommunityEdgeWeights(v) {
+        resetScratch();
+        const ci = iget(nodeCommunity, v);
+        touch(ci);
+        if (graph.directed) {
+            const outL = graph.outEdges[v];
+            for (let k = 0; k < outL.length; k++) {
+                const j = outL[k].to;
+                const w = outL[k].w;
+                const cj = iget(nodeCommunity, j);
+                touch(cj);
+                outEdgeWeightToCommunity[cj] = fget(outEdgeWeightToCommunity, cj) + w;
+            }
+            const inL = graph.inEdges[v];
+            for (let k = 0; k < inL.length; k++) {
+                const i2 = inL[k].from;
+                const w = inL[k].w;
+                const ci2 = iget(nodeCommunity, i2);
+                touch(ci2);
+                inEdgeWeightFromCommunity[ci2] = fget(inEdgeWeightFromCommunity, ci2) + w;
+            }
+        }
+        else {
+            const list = graph.outEdges[v];
+            for (let k = 0; k < list.length; k++) {
+                const j = list[k].to;
+                const w = list[k].w;
+                const cj = iget(nodeCommunity, j);
+                touch(cj);
+                neighborEdgeWeightToCommunity[cj] = fget(neighborEdgeWeightToCommunity, cj) + w;
+            }
+        }
+        return candidateCommunityCount;
+    }
+    const twoMUndirected = graph.totalWeight;
+    function deltaModularityUndirected(v, newC, gamma = 1.0) {
+        const oldC = iget(nodeCommunity, v);
+        if (newC === oldC)
+            return 0;
+        const strengthV = fget(graph.strengthOut, v);
+        const weightToNew = newC < neighborEdgeWeightToCommunity.length
+            ? fget(neighborEdgeWeightToCommunity, newC) || 0
+            : 0;
+        const weightToOld = fget(neighborEdgeWeightToCommunity, oldC) || 0;
+        const totalStrengthNew = newC < communityTotalStrength.length ? fget(communityTotalStrength, newC) : 0;
+        const totalStrengthOld = fget(communityTotalStrength, oldC);
+        const gain_remove = -(weightToOld / twoMUndirected -
+            (gamma * (strengthV * totalStrengthOld)) / (twoMUndirected * twoMUndirected));
+        const gain_add = weightToNew / twoMUndirected -
+            (gamma * (strengthV * totalStrengthNew)) / (twoMUndirected * twoMUndirected);
+        return gain_remove + gain_add;
+    }
+    function deltaModularityDirected(v, newC, gamma = 1.0) {
+        const oldC = iget(nodeCommunity, v);
+        if (newC === oldC)
+            return 0;
+        const totalEdgeWeight = graph.totalWeight;
+        const strengthOutV = fget(graph.strengthOut, v);
+        const strengthInV = fget(graph.strengthIn, v);
+        const inFromNew = newC < inEdgeWeightFromCommunity.length ? fget(inEdgeWeightFromCommunity, newC) || 0 : 0;
+        const outToNew = newC < outEdgeWeightToCommunity.length ? fget(outEdgeWeightToCommunity, newC) || 0 : 0;
+        const inFromOld = fget(inEdgeWeightFromCommunity, oldC) || 0;
+        const outToOld = fget(outEdgeWeightToCommunity, oldC) || 0;
+        const totalInStrengthNew = newC < communityTotalInStrength.length ? fget(communityTotalInStrength, newC) : 0;
+        const totalOutStrengthNew = newC < communityTotalOutStrength.length ? fget(communityTotalOutStrength, newC) : 0;
+        const totalInStrengthOld = fget(communityTotalInStrength, oldC);
+        const totalOutStrengthOld = fget(communityTotalOutStrength, oldC);
+        // Self-loop correction + constant term (see modularity.ts diffModularityDirected)
+        const selfW = fget(graph.selfLoop, v) || 0;
+        const deltaInternal = (inFromNew + outToNew - inFromOld - outToOld + 2 * selfW) / totalEdgeWeight;
+        const deltaExpected = (gamma *
+            (strengthOutV * (totalInStrengthNew - totalInStrengthOld) +
+                strengthInV * (totalOutStrengthNew - totalOutStrengthOld) +
+                2 * strengthOutV * strengthInV)) /
+            (totalEdgeWeight * totalEdgeWeight);
+        return deltaInternal - deltaExpected;
+    }
+    function deltaCPM(v, newC, gamma = 1.0) {
+        const oldC = iget(nodeCommunity, v);
+        if (newC === oldC)
+            return 0;
+        let w_old;
+        let w_new;
+        let selfCorrection = 0;
+        if (graph.directed) {
+            w_old =
+                (fget(outEdgeWeightToCommunity, oldC) || 0) + (fget(inEdgeWeightFromCommunity, oldC) || 0);
+            w_new =
+                newC < outEdgeWeightToCommunity.length
+                    ? (fget(outEdgeWeightToCommunity, newC) || 0) +
+                        (fget(inEdgeWeightFromCommunity, newC) || 0)
+                    : 0;
+            // Self-loop correction (see cpm.ts diffCPM)
+            selfCorrection = 2 * (fget(graph.selfLoop, v) || 0);
+        }
+        else {
+            w_old = fget(neighborEdgeWeightToCommunity, oldC) || 0;
+            w_new =
+                newC < neighborEdgeWeightToCommunity.length
+                    ? fget(neighborEdgeWeightToCommunity, newC) || 0
+                    : 0;
+        }
+        const nodeSz = fget(graph.size, v) || 1;
+        const sizeOld = fget(communityTotalSize, oldC) || 0;
+        const sizeNew = newC < communityTotalSize.length ? fget(communityTotalSize, newC) : 0;
+        return w_new - w_old + selfCorrection - gamma * nodeSz * (sizeNew - sizeOld + nodeSz);
+    }
+    function moveNodeToCommunity(v, newC) {
+        const oldC = iget(nodeCommunity, v);
+        if (oldC === newC)
+            return false;
+        if (newC >= communityCount) {
+            ensureCommCapacity(newC + 1);
+            communityCount = newC + 1;
+        }
+        const strengthOutV = fget(graph.strengthOut, v);
+        const strengthInV = fget(graph.strengthIn, v);
+        const selfLoopWeight = fget(graph.selfLoop, v);
+        const nodeSz = fget(graph.size, v);
+        communityNodeCount[oldC] = iget(communityNodeCount, oldC) - 1;
+        communityNodeCount[newC] = iget(communityNodeCount, newC) + 1;
+        communityTotalSize[oldC] = fget(communityTotalSize, oldC) - nodeSz;
+        communityTotalSize[newC] = fget(communityTotalSize, newC) + nodeSz;
+        if (graph.directed) {
+            communityTotalOutStrength[oldC] = fget(communityTotalOutStrength, oldC) - strengthOutV;
+            communityTotalOutStrength[newC] = fget(communityTotalOutStrength, newC) + strengthOutV;
+            communityTotalInStrength[oldC] = fget(communityTotalInStrength, oldC) - strengthInV;
+            communityTotalInStrength[newC] = fget(communityTotalInStrength, newC) + strengthInV;
+        }
+        else {
+            communityTotalStrength[oldC] = fget(communityTotalStrength, oldC) - strengthOutV;
+            communityTotalStrength[newC] = fget(communityTotalStrength, newC) + strengthOutV;
+        }
+        if (graph.directed) {
+            const outToOld = fget(outEdgeWeightToCommunity, oldC) || 0;
+            const inFromOld = fget(inEdgeWeightFromCommunity, oldC) || 0;
+            const outToNew = newC < outEdgeWeightToCommunity.length ? fget(outEdgeWeightToCommunity, newC) || 0 : 0;
+            const inFromNew = newC < inEdgeWeightFromCommunity.length ? fget(inEdgeWeightFromCommunity, newC) || 0 : 0;
+            // outToOld/inFromOld already include the self-loop weight (self-loops are
+            // in outEdges/inEdges), so subtract it once to avoid triple-counting.
+            communityInternalEdgeWeight[oldC] =
+                fget(communityInternalEdgeWeight, oldC) - (outToOld + inFromOld - selfLoopWeight);
+            communityInternalEdgeWeight[newC] =
+                fget(communityInternalEdgeWeight, newC) + (outToNew + inFromNew + selfLoopWeight);
+        }
+        else {
+            const weightToOld = fget(neighborEdgeWeightToCommunity, oldC) || 0;
+            const weightToNew = fget(neighborEdgeWeightToCommunity, newC) || 0;
+            communityInternalEdgeWeight[oldC] =
+                fget(communityInternalEdgeWeight, oldC) - (2 * weightToOld + selfLoopWeight);
+            communityInternalEdgeWeight[newC] =
+                fget(communityInternalEdgeWeight, newC) + (2 * weightToNew + selfLoopWeight);
+        }
+        nodeCommunity[v] = newC;
+        return true;
+    }
+    function compactCommunityIds(opts = {}) {
+        const ids = [];
+        for (let c = 0; c < communityCount; c++)
+            if (iget(communityNodeCount, c) > 0)
+                ids.push(c);
+        if (opts.keepOldOrder) {
+            ids.sort((a, b) => a - b);
+        }
+        else if (opts.preserveMap instanceof Map) {
+            const preserveMap = opts.preserveMap;
+            ids.sort((a, b) => {
+                const pa = preserveMap.get(a);
+                const pb = preserveMap.get(b);
+                if (pa != null && pb != null && pa !== pb)
+                    return pa - pb;
+                if (pa != null && pb == null)
+                    return -1;
+                if (pb != null && pa == null)
+                    return 1;
+                return (fget(communityTotalSize, b) - fget(communityTotalSize, a) ||
+                    iget(communityNodeCount, b) - iget(communityNodeCount, a) ||
+                    a - b);
+            });
+        }
+        else {
+            ids.sort((a, b) => fget(communityTotalSize, b) - fget(communityTotalSize, a) ||
+                iget(communityNodeCount, b) - iget(communityNodeCount, a) ||
+                a - b);
+        }
+        const newId = new Int32Array(communityCount).fill(-1);
+        ids.forEach((c, i) => {
+            newId[c] = i;
+        });
+        for (let i = 0; i < nodeCommunity.length; i++)
+            nodeCommunity[i] = iget(newId, iget(nodeCommunity, i));
+        const remappedCount = ids.length;
+        const newTotalSize = new Float64Array(remappedCount);
+        const newNodeCount = new Int32Array(remappedCount);
+        const newInternalEdgeWeight = new Float64Array(remappedCount);
+        const newTotalStrength = new Float64Array(remappedCount);
+        const newTotalOutStrength = new Float64Array(remappedCount);
+        const newTotalInStrength = new Float64Array(remappedCount);
+        for (let i = 0; i < n; i++) {
+            const c = iget(nodeCommunity, i);
+            newTotalSize[c] = fget(newTotalSize, c) + fget(graph.size, i);
+            newNodeCount[c] = iget(newNodeCount, c) + 1;
+            if (graph.directed) {
+                newTotalOutStrength[c] = fget(newTotalOutStrength, c) + fget(graph.strengthOut, i);
+                newTotalInStrength[c] = fget(newTotalInStrength, c) + fget(graph.strengthIn, i);
+            }
+            else {
+                newTotalStrength[c] = fget(newTotalStrength, c) + fget(graph.strengthOut, i);
+            }
+            if (fget(graph.selfLoop, i) !== 0)
+                newInternalEdgeWeight[c] = fget(newInternalEdgeWeight, c) + fget(graph.selfLoop, i);
+        }
+        if (graph.directed) {
+            for (let i = 0; i < n; i++) {
+                const ci = iget(nodeCommunity, i);
+                const list = graph.outEdges[i];
+                for (let k = 0; k < list.length; k++) {
+                    const { to: j, w } = list[k];
+                    if (i === j)
+                        continue; // self-loop already counted via graph.selfLoop[i]
+                    if (ci === iget(nodeCommunity, j))
+                        newInternalEdgeWeight[ci] = fget(newInternalEdgeWeight, ci) + w;
+                }
+            }
+        }
+        else {
+            for (let i = 0; i < n; i++) {
+                const ci = iget(nodeCommunity, i);
+                const list = graph.outEdges[i];
+                for (let k = 0; k < list.length; k++) {
+                    const { to: j, w } = list[k];
+                    if (j <= i)
+                        continue;
+                    if (ci === iget(nodeCommunity, j))
+                        newInternalEdgeWeight[ci] = fget(newInternalEdgeWeight, ci) + w;
+                }
+            }
+        }
+        communityCount = remappedCount;
+        communityTotalSize = newTotalSize;
+        communityNodeCount = newNodeCount;
+        communityInternalEdgeWeight = newInternalEdgeWeight;
+        communityTotalStrength = newTotalStrength;
+        communityTotalOutStrength = newTotalOutStrength;
+        communityTotalInStrength = newTotalInStrength;
+    }
+    function getCommunityMembers() {
+        const comms = new Array(communityCount);
+        for (let i = 0; i < communityCount; i++)
+            comms[i] = [];
+        for (let i = 0; i < n; i++)
+            comms[iget(nodeCommunity, i)].push(i);
+        return comms;
+    }
+    function getCommunityTotalSizeFn(c) {
+        return c < communityTotalSize.length ? fget(communityTotalSize, c) : 0;
+    }
+    function getCommunityNodeCountFn(c) {
+        return c < communityNodeCount.length ? iget(communityNodeCount, c) : 0;
+    }
+    return {
+        n,
+        get communityCount() {
+            return communityCount;
+        },
+        nodeCommunity,
+        get communityTotalSize() {
+            return communityTotalSize;
+        },
+        get communityNodeCount() {
+            return communityNodeCount;
+        },
+        get communityInternalEdgeWeight() {
+            return communityInternalEdgeWeight;
+        },
+        get communityTotalStrength() {
+            return communityTotalStrength;
+        },
+        get communityTotalOutStrength() {
+            return communityTotalOutStrength;
+        },
+        get communityTotalInStrength() {
+            return communityTotalInStrength;
+        },
+        resizeCommunities(newCount) {
+            ensureCommCapacity(newCount);
+            communityCount = newCount;
+        },
+        initializeAggregates,
+        accumulateNeighborCommunityEdgeWeights,
+        getCandidateCommunityCount: () => candidateCommunityCount,
+        getCandidateCommunityAt: (i) => iget(candidateCommunities, i),
+        getNeighborEdgeWeightToCommunity: (c) => fget(neighborEdgeWeightToCommunity, c) || 0,
+        getOutEdgeWeightToCommunity: (c) => fget(outEdgeWeightToCommunity, c) || 0,
+        getInEdgeWeightFromCommunity: (c) => fget(inEdgeWeightFromCommunity, c) || 0,
+        deltaModularityUndirected,
+        deltaModularityDirected,
+        deltaCPM,
+        moveNodeToCommunity,
+        compactCommunityIds,
+        getCommunityMembers,
+        getCommunityTotalSize: getCommunityTotalSizeFn,
+        getCommunityNodeCount: getCommunityNodeCountFn,
+        graph: undefined,
+    };
+}
+function growFloat(a, to) {
+    const b = new Float64Array(to);
+    for (let i = 0; i < a.length; i++)
+        b[i] = a[i];
+    return b;
+}
+function growInt(a, to) {
+    const b = new Int32Array(to);
+    for (let i = 0; i < a.length; i++)
+        b[i] = a[i];
+    return b;
+}
+//# sourceMappingURL=partition.js.map

package/dist/graph/algorithms/leiden/partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition.js","sourceRoot":"","sources":["../../../../src/graph/algorithms/leiden/partition.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAuCH,yFAAyF;AACzF,gGAAgG;AAChG,SAAS,IAAI,CAAC,CAAe,EAAE,CAAS;IACtC,OAAO,CAAC,CAAC,CAAC,CAAW,CAAC;AACxB,CAAC;AACD,SAAS,IAAI,CAAC,CAAa,EAAE,CAAS;IACpC,OAAO,CAAC,CAAC,CAAC,CAAW,CAAC;AACxB,CAAC;AACD,SAAS,KAAK,CAAC,CAAa,EAAE,CAAS;IACrC,OAAO,CAAC,CAAC,CAAC,CAAW,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAmB;IAC/C,MAAM,CAAC,GAAW,KAAK,CAAC,CAAC,CAAC;IAC1B,MAAM,aAAa,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjD,IAAI,cAAc,GAAW,CAAC,CAAC;IAE/B,IAAI,kBAAkB,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IAC1D,IAAI,kBAAkB,GAAG,IAAI,UAAU,CAAC,cAAc,CAAC,CAAC;IACxD,IAAI,2BAA2B,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IACnE,IAAI,sBAAsB,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IAC9D,IAAI,yBAAyB,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IACjE,IAAI,wBAAwB,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IAEhE,MAAM,oBAAoB,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,uBAAuB,GAAW,CAAC,CAAC;IACxC,MAAM,6BAA6B,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,wBAAwB,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,yBAAyB,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,oBAAoB,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAE/C,SAAS,kBAAkB,CAAC,QAAgB;QAC1C,IAAI,QAAQ,IAAI,kBAAkB,CAAC,MAAM;YAAE,OAAO;QAClD,MAAM,MAAM,GAAW,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QACtF,kBAAkB,GAAG,SAAS,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;QAC3D,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;QACzD,2BAA2B,GAAG,SAAS,CAAC,2BAA2B,EAAE,MAAM,CAAC,CAAC;QAC7E,sBAAsB,GAAG,SAAS,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC;QACnE,yBAAyB,GAAG,SAAS,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;QACzE,wBAAwB,GAAG,SAAS,CAAC,wBAAwB,EAAE,MAAM,CAAC,CAAC;IACzE,CAAC;IAED,SAAS,oBAAoB;QAC3B,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YACzC,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC1E,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACxD,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,yBAAyB,CAAC,CAAC,CAAC;oBAC1B,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBAClE,wBAAwB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC9F,CAAC;iBAAM,CAAC;gBACN,sBAAsB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC3F,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC;gBAC/B,2BAA2B,CAAC,CAAC,CAAC;oBAC5B,IAAI,CAAC,2BAA2B,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;oBACnC,IAAI,CAAC,KAAK,CAAC;wBAAE,SAAS,CAAC,kDAAkD;oBACzE,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;wBAC/B,2BAA2B,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,2BAA2B,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBAChF,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;oBACnC,IAAI,CAAC,IAAI,CAAC;wBAAE,SAAS;oBACrB,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;wBAC/B,2BAA2B,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,2BAA2B,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBAChF,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,YAAY;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,uBAAuB,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,CAAC,GAAW,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;YAChD,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5B,6BAA6B,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACrC,wBAAwB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChC,yBAAyB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,uBAAuB,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,SAAS,KAAK,CAAC,CAAS;QACtB,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC,CAAC;YAAE,OAAO;QAC3C,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,oBAAoB,CAAC,uBAAuB,EAAE,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IAED,SAAS,sCAAsC,CAAC,CAAS;QACvD,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAC1C,KAAK,CAAC,EAAE,CAAC,CAAC;QACV,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC7B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,KAAK,CAAC,EAAE,CAAC,CAAC;gBACV,wBAAwB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,wBAAwB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YACxE,CAAC;YACD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAW,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC;gBAChC,MAAM,CAAC,GAAW,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC5B,MAAM,GAAG,GAAW,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;gBAC5C,KAAK,CAAC,GAAG,CAAC,CAAC;gBACX,yBAAyB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,yBAAyB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC7B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,KAAK,CAAC,EAAE,CAAC,CAAC;gBACV,6BAA6B,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,6BAA6B,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QACD,OAAO,uBAAuB,CAAC;IACjC,CAAC;IAED,MAAM,cAAc,GAAW,KAAK,CAAC,WAAW,CAAC;IACjD,SAAS,yBAAyB,CAAC,CAAS,EAAE,IAAY,EAAE,QAAgB,GAAG;QAC7E,MAAM,IAAI,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,MAAM,SAAS,GAAW,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,WAAW,GACf,IAAI,GAAG,6BAA6B,CAAC,MAAM;YACzC,CAAC,CAAC,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC;YAChD,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,WAAW,GAAW,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3E,MAAM,gBAAgB,GACpB,IAAI,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,gBAAgB,GAAW,IAAI,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC;QACpE,MAAM,WAAW,GAAW,CAAC,CAC3B,WAAW,GAAG,cAAc;YAC5B,CAAC,KAAK,GAAG,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,cAAc,GAAG,cAAc,CAAC,CAC7E,CAAC;QACF,MAAM,QAAQ,GACZ,WAAW,GAAG,cAAc;YAC5B,CAAC,KAAK,GAAG,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,cAAc,GAAG,cAAc,CAAC,CAAC;QAC/E,OAAO,WAAW,GAAG,QAAQ,CAAC;IAChC,CAAC;IAED,SAAS,uBAAuB,CAAC,CAAS,EAAE,IAAY,EAAE,QAAgB,GAAG;QAC3E,MAAM,IAAI,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,MAAM,eAAe,GAAW,KAAK,CAAC,WAAW,CAAC;QAClD,MAAM,YAAY,GAAW,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,WAAW,GAAW,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,SAAS,GACb,IAAI,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,QAAQ,GACZ,IAAI,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,SAAS,GAAW,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAW,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,MAAM,kBAAkB,GACtB,IAAI,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,MAAM,mBAAmB,GACvB,IAAI,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,MAAM,kBAAkB,GAAW,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;QACxE,MAAM,mBAAmB,GAAW,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,CAAC;QAC1E,kFAAkF;QAClF,MAAM,KAAK,GAAW,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,MAAM,aAAa,GACjB,CAAC,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe,CAAC;QAC9E,MAAM,aAAa,GACjB,CAAC,KAAK;YACJ,CAAC,YAAY,GAAG,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;gBACvD,WAAW,GAAG,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;gBACzD,CAAC,GAAG,YAAY,GAAG,WAAW,CAAC,CAAC;YACpC,CAAC,eAAe,GAAG,eAAe,CAAC,CAAC;QACtC,OAAO,aAAa,GAAG,aAAa,CAAC;IACvC,CAAC;IAED,SAAS,QAAQ,CAAC,CAAS,EAAE,IAAY,EAAE,QAAgB,GAAG;QAC5D,MAAM,IAAI,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,IAAI,KAAa,CAAC;QAClB,IAAI,KAAa,CAAC;QAClB,IAAI,cAAc,GAAW,CAAC,CAAC;QAC/B,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,KAAK;gBACH,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7F,KAAK;gBACH,IAAI,GAAG,wBAAwB,CAAC,MAAM;oBACpC,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;wBAC3C,CAAC,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC9C,CAAC,CAAC,CAAC,CAAC;YACR,4CAA4C;YAC5C,cAAc,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,KAAK;gBACH,IAAI,GAAG,6BAA6B,CAAC,MAAM;oBACzC,CAAC,CAAC,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC;oBAChD,CAAC,CAAC,CAAC,CAAC;QACV,CAAC;QACD,MAAM,MAAM,GAAW,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,OAAO,GAAW,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAW,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9F,OAAO,KAAK,GAAG,KAAK,GAAG,cAAc,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC;IACxF,CAAC;IAED,SAAS,mBAAmB,CAAC,CAAS,EAAE,IAAY;QAClD,MAAM,IAAI,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,IAAI,IAAI,cAAc,EAAE,CAAC;YAC3B,kBAAkB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7B,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,YAAY,GAAW,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,WAAW,GAAW,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,cAAc,GAAW,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,MAAM,GAAW,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAE3C,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC;QACnE,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC;QACnE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,yBAAyB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;YACvF,yBAAyB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;YACvF,wBAAwB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC;YACpF,wBAAwB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC;QACtF,CAAC;aAAM,CAAC;YACN,sBAAsB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;YACjF,sBAAsB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;QACnF,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAW,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACnE,MAAM,SAAS,GAAW,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACrE,MAAM,QAAQ,GACZ,IAAI,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzF,MAAM,SAAS,GACb,IAAI,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,0EAA0E;YAC1E,sEAAsE;YACtE,2BAA2B,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,GAAG,cAAc,CAAC,CAAC;YACpF,2BAA2B,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,GAAG,cAAc,CAAC,CAAC;QACtF,CAAC;aAAM,CAAC;YACN,MAAM,WAAW,GAAW,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3E,MAAM,WAAW,GAAW,IAAI,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3E,2BAA2B,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,cAAc,CAAC,CAAC;YAC/E,2BAA2B,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,cAAc,CAAC,CAAC;QACjF,CAAC;QAED,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,mBAAmB,CAAC,OAAuB,EAAE;QACpD,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1F,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,IAAI,CAAC,WAAW,YAAY,GAAG,EAAE,CAAC;YAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;YACrC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,KAAK,EAAE;oBAAE,OAAO,EAAE,GAAG,EAAE,CAAC;gBAC1D,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI;oBAAE,OAAO,CAAC,CAAC,CAAC;gBACxC,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI;oBAAE,OAAO,CAAC,CAAC;gBACvC,OAAO,CACL,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;oBACzD,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;oBACzD,CAAC,GAAG,CAAC,CACN,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;gBACzD,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;gBACzD,CAAC,GAAG,CAAC,CACR,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;YAC3C,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,aAAa,GAAW,GAAG,CAAC,MAAM,CAAC;QACzC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC;QACnD,MAAM,qBAAqB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;QAC9D,MAAM,gBAAgB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;QACzD,MAAM,mBAAmB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;QAC5D,MAAM,kBAAkB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YACzC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9D,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,mBAAmB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBACnF,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAClF,CAAC;iBAAM,CAAC;gBACN,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC;gBAC/B,qBAAqB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;oBAC9B,IAAI,CAAC,KAAK,CAAC;wBAAE,SAAS,CAAC,kDAAkD;oBACzE,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;wBAC/B,qBAAqB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,qBAAqB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;oBAC9B,IAAI,CAAC,IAAI,CAAC;wBAAE,SAAS;oBACrB,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;wBAC/B,qBAAqB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,qBAAqB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;QACD,cAAc,GAAG,aAAa,CAAC;QAC/B,kBAAkB,GAAG,YAAY,CAAC;QAClC,kBAAkB,GAAG,YAAY,CAAC;QAClC,2BAA2B,GAAG,qBAAqB,CAAC;QACpD,sBAAsB,GAAG,gBAAgB,CAAC;QAC1C,yBAAyB,GAAG,mBAAmB,CAAC;QAChD,wBAAwB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IAED,SAAS,mBAAmB;QAC1B,MAAM,KAAK,GAAe,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,uBAAuB,CAAC,CAAS;QACxC,OAAO,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,CAAC;IACD,SAAS,uBAAuB,CAAC,CAAS;QACxC,OAAO,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,OAAO;QACL,CAAC;QACD,IAAI,cAAc;YAChB,OAAO,cAAc,CAAC;QACxB,CAAC;QACD,aAAa;QACb,IAAI,kBAAkB;YACpB,OAAO,kBAAkB,CAAC;QAC5B,CAAC;QACD,IAAI,kBAAkB;YACpB,OAAO,kBAAkB,CAAC;QAC5B,CAAC;QACD,IAAI,2BAA2B;YAC7B,OAAO,2BAA2B,CAAC;QACrC,CAAC;QACD,IAAI,sBAAsB;YACxB,OAAO,sBAAsB,CAAC;QAChC,CAAC;QACD,IAAI,yBAAyB;YAC3B,OAAO,yBAAyB,CAAC;QACnC,CAAC;QACD,IAAI,wBAAwB;YAC1B,OAAO,wBAAwB,CAAC;QAClC,CAAC;QACD,iBAAiB,CAAC,QAAgB;YAChC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;YAC7B,cAAc,GAAG,QAAQ,CAAC;QAC5B,CAAC;QACD,oBAAoB;QACpB,sCAAsC;QACtC,0BAA0B,EAAE,GAAW,EAAE,CAAC,uBAAuB;QACjE,uBAAuB,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAC7E,gCAAgC,EAAE,CAAC,CAAS,EAAU,EAAE,CACtD,IAAI,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC;QAC7C,2BAA2B,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC,CAAC,IAAI,CAAC;QAC1F,4BAA4B,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC,IAAI,CAAC;QAC5F,yBAAyB;QACzB,uBAAuB;QACvB,QAAQ;QACR,mBAAmB;QACnB,mBAAmB;QACnB,mBAAmB;QACnB,qBAAqB,EAAE,uBAAuB;QAC9C,qBAAqB,EAAE,uBAAuB;QAC9C,KAAK,EAAE,SAAS;KACjB,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAe,EAAE,EAAU;IAC5C,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,CAAC;IACzD,OAAO,CAAC,CAAC;AACX,CAAC;AACD,SAAS,OAAO,CAAC,CAAa,EAAE,EAAU;IACxC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,CAAC;IACzD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/graph/algorithms/leiden/rng.d.ts

@@ -0,0 +1,9 @@
+export interface Rng {
+    nextDouble(): number;
+}
+/**
+ * Seeded PRNG (mulberry32).
+ * Drop-in replacement for ngraph.random — only nextDouble() is needed.
+ */
+export declare function createRng(seed?: number): Rng;
+//# sourceMappingURL=rng.d.ts.map

package/dist/graph/algorithms/leiden/rng.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.d.ts","sourceRoot":"","sources":["../../../../src/graph/algorithms/leiden/rng.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,GAAG;IAClB,UAAU,IAAI,MAAM,CAAC;CACtB;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,IAAI,GAAE,MAAW,GAAG,GAAG,CAWhD"}

package/dist/graph/algorithms/leiden/rng.js

@@ -0,0 +1,17 @@
+/**
+ * Seeded PRNG (mulberry32).
+ * Drop-in replacement for ngraph.random — only nextDouble() is needed.
+ */
+export function createRng(seed = 42) {
+    let s = seed | 0;
+    return {
+        nextDouble() {
+            s |= 0;
+            s = (s + 0x6d2b79f5) | 0;
+            let t = Math.imul(s ^ (s >>> 15), 1 | s);
+            t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
+            return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+        },
+    };
+}
+//# sourceMappingURL=rng.js.map

package/dist/graph/algorithms/leiden/rng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.js","sourceRoot":"","sources":["../../../../src/graph/algorithms/leiden/rng.ts"],"names":[],"mappings":"AAIA;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE;IACzC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,OAAO;QACL,UAAU;YACR,CAAC,IAAI,CAAC,CAAC;YACP,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACzC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;QAC/C,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/graph/algorithms/louvain.d.ts

@@ -1,5 +1,21 @@
-export function louvainCommunities(graph: any, opts?: {}): {
-    assignments: Map<any, any>;
-    modularity: any;
-};
+/**
+ * Community detection via vendored Leiden algorithm.
+ * Maintains backward-compatible API: { assignments: Map<string, number>, modularity: number }
+ *
+ * Note: Always runs in undirected mode (`directed: false`) regardless of
+ * the input graph's directedness. For direction-aware community detection,
+ * use `detectClusters` from `./leiden/index.js` directly.
+ */
+import type { CodeGraph } from '../model.js';
+export interface LouvainOptions {
+    resolution?: number;
+    maxLevels?: number;
+    maxLocalPasses?: number;
+    refinementTheta?: number;
+}
+export interface LouvainResult {
+    assignments: Map<string, number>;
+    modularity: number;
+}
+export declare function louvainCommunities(graph: CodeGraph, opts?: LouvainOptions): LouvainResult;
 //# sourceMappingURL=louvain.d.ts.map

package/dist/graph/algorithms/louvain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.js"],"names":[],"mappings":"AASA;;;EAgBC"}
+{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAI7C,MAAM,WAAW,cAAc;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAE,cAAmB,GAAG,aAAa,CAsB7F"}

package/dist/graph/algorithms/louvain.js

@@ -1,22 +1,23 @@
-/**
- * Louvain community detection via graphology.
- *
- * @param {import('../model.js').CodeGraph} graph
- * @param {{ resolution?: number }} [opts]
- * @returns {{ assignments: Map<string, number>, modularity: number }}
- */
-import graphologyLouvain from 'graphology-communities-louvain';
+import { detectClusters } from './leiden/index.js';
 export function louvainCommunities(graph, opts = {}) {
-    const gy = graph.toGraphology({ type: 'undirected' });
-    if (gy.order === 0 || gy.size === 0) {
+    if (graph.nodeCount === 0 || graph.edgeCount === 0) {
         return { assignments: new Map(), modularity: 0 };
     }
     const resolution = opts.resolution ?? 1.0;
-    const details = graphologyLouvain.detailed(gy, { resolution });
+    const result = detectClusters(graph, {
+        resolution,
+        randomSeed: 42,
+        directed: false,
+        ...(opts.maxLevels != null && { maxLevels: opts.maxLevels }),
+        ...(opts.maxLocalPasses != null && { maxLocalPasses: opts.maxLocalPasses }),
+        ...(opts.refinementTheta != null && { refinementTheta: opts.refinementTheta }),
+    });
     const assignments = new Map();
-    for (const [nodeId, communityId] of Object.entries(details.communities)) {
-        assignments.set(nodeId, communityId);
+    for (const [id] of graph.nodes()) {
+        const cls = result.getClass(id);
+        if (cls != null)
+            assignments.set(id, cls);
     }
-    return { assignments, modularity: details.modularity };
+    return { assignments, modularity: result.quality() };
 }
 //# sourceMappingURL=louvain.js.map

package/dist/graph/algorithms/louvain.js.map

@@ -1 +1 @@
-{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,iBAAiB,MAAM,gCAAgC,CAAC;AAE/D,MAAM,UAAU,kBAAkB,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE;IACjD,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;IAEtD,IAAI,EAAE,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAC1C,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAE/D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACxE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;AACzD,CAAC"}
+{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAcnD,MAAM,UAAU,kBAAkB,CAAC,KAAgB,EAAE,OAAuB,EAAE;IAC5E,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;QACnD,OAAO,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAW,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAClD,MAAM,MAAM,GAAyB,cAAc,CAAC,KAAK,EAAE;QACzD,UAAU;QACV,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,KAAK;QACf,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC5D,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,IAAI,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC;KAC/E,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,GAAG,IAAI,IAAI;YAAE,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;AACvD,CAAC"}

package/dist/graph/algorithms/shortest-path.d.ts

@@ -1,10 +1,8 @@
+import type { CodeGraph } from '../model.js';
 /**
  * BFS-based shortest path on a CodeGraph.
  *
- * @param {import('../model.js').CodeGraph} graph
- * @param {string} fromId
- * @param {string} toId
- * @returns {string[]|null} Path from fromId to toId (inclusive), or null if unreachable
+ * @returns Path from fromId to toId (inclusive), or null if unreachable
  */
-export function shortestPath(graph: import("../model.js").CodeGraph, fromId: string, toId: string): string[] | null;
+export declare function shortestPath(graph: CodeGraph, fromId: string, toId: string): string[] | null;
 //# sourceMappingURL=shortest-path.d.ts.map

package/dist/graph/algorithms/shortest-path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,oCALW,OAAO,aAAa,EAAE,SAAS,UAC/B,MAAM,QACN,MAAM,GACJ,MAAM,EAAE,GAAC,IAAI,CAkCzB"}
+{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAgC5F"}

package/dist/graph/algorithms/shortest-path.js

@@ -1,10 +1,7 @@
 /**
  * BFS-based shortest path on a CodeGraph.
  *
- * @param {import('../model.js').CodeGraph} graph
- * @param {string} fromId
- * @param {string} toId
- * @returns {string[]|null} Path from fromId to toId (inclusive), or null if unreachable
+ * @returns Path from fromId to toId (inclusive), or null if unreachable
  */
 export function shortestPath(graph, fromId, toId) {
     const from = String(fromId);
@@ -29,7 +26,7 @@ export function shortestPath(graph, fromId, toId) {
                 let node = to;
                 while (node !== null) {
                     path.push(node);
-                    node = parent.get(node);
+                    node = parent.get(node) ?? null;
                 }
                 return path.reverse();
             }

package/dist/graph/algorithms/shortest-path.js.map

@@ -1 +1 @@
-{"version":3,"file":"shortest-path.js","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAExB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACjD,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;gBACpB,mBAAmB;gBACnB,MAAM,IAAI,GAAG,EAAE,CAAC;gBAChB,IAAI,IAAI,GAAG,EAAE,CAAC;gBACd,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;gBACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"shortest-path.js","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAgB,EAAE,MAAc,EAAE,IAAY;IACzE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAExB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAE,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACjD,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;gBACpB,mBAAmB;gBACnB,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,IAAI,IAAI,GAAkB,EAAE,CAAC;gBAC7B,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;gBAClC,CAAC;gBACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}