optave-codegraph 3.13.0

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

@@ -0,0 +1,438 @@
+/**
+ * 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];
+}
+/* ------------------------------------------------------------------ */
+/*  Aggregate helpers (shared by initializeAggregates & compact)      */
+/* ------------------------------------------------------------------ */
+/**
+ * Accumulate per-community node-level totals (size, count, strength) into the
+ * provided aggregate arrays. Both `initializeAggregates` and `compactCommunityIds`
+ * share this logic — extracting it eliminates the duplication.
+ */
+function accumulateNodeAggregates(graph, nodeCommunity, n, totalSize, nodeCount, internalEdgeWeight, totalStrength, totalOutStrength, totalInStrength) {
+    for (let i = 0; i < n; i++) {
+        const c = iget(nodeCommunity, i);
+        totalSize[c] = fget(totalSize, c) + fget(graph.size, i);
+        nodeCount[c] = iget(nodeCount, c) + 1;
+        if (graph.directed) {
+            totalOutStrength[c] = fget(totalOutStrength, c) + fget(graph.strengthOut, i);
+            totalInStrength[c] = fget(totalInStrength, c) + fget(graph.strengthIn, i);
+        }
+        else {
+            totalStrength[c] = fget(totalStrength, c) + fget(graph.strengthOut, i);
+        }
+        if (fget(graph.selfLoop, i) !== 0)
+            internalEdgeWeight[c] = fget(internalEdgeWeight, c) + fget(graph.selfLoop, i);
+    }
+}
+/**
+ * Accumulate intra-community edge weights. For directed graphs, counts all
+ * intra-community non-self edges. For undirected, counts each edge once (j > i).
+ */
+function accumulateInternalEdgeWeights(graph, nodeCommunity, n, internalEdgeWeight) {
+    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))
+                    internalEdgeWeight[ci] = fget(internalEdgeWeight, 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))
+                    internalEdgeWeight[ci] = fget(internalEdgeWeight, ci) + w;
+            }
+        }
+    }
+}
+/**
+ * Sort community IDs according to the compaction options: preserve original
+ * order, respect a user-provided label map, or sort by descending size.
+ * Returns the sorted list of non-empty community IDs.
+ */
+function buildSortedCommunityIds(ids, opts, communityTotalSize, communityNodeCount) {
+    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);
+    }
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: capacity management                                     */
+/* ------------------------------------------------------------------ */
+function ensureCommCapacity(s, newCount) {
+    if (newCount <= s.communityTotalSize.length)
+        return;
+    const growTo = Math.max(newCount, Math.ceil(s.communityTotalSize.length * 1.5));
+    s.communityTotalSize = growFloat(s.communityTotalSize, growTo);
+    s.communityNodeCount = growInt(s.communityNodeCount, growTo);
+    s.communityInternalEdgeWeight = growFloat(s.communityInternalEdgeWeight, growTo);
+    s.communityTotalStrength = growFloat(s.communityTotalStrength, growTo);
+    s.communityTotalOutStrength = growFloat(s.communityTotalOutStrength, growTo);
+    s.communityTotalInStrength = growFloat(s.communityTotalInStrength, growTo);
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: aggregate initialization                                */
+/* ------------------------------------------------------------------ */
+function initAggregates(s) {
+    s.communityTotalSize.fill(0);
+    s.communityNodeCount.fill(0);
+    s.communityInternalEdgeWeight.fill(0);
+    s.communityTotalStrength.fill(0);
+    s.communityTotalOutStrength.fill(0);
+    s.communityTotalInStrength.fill(0);
+    accumulateNodeAggregates(s.graph, s.nodeCommunity, s.n, s.communityTotalSize, s.communityNodeCount, s.communityInternalEdgeWeight, s.communityTotalStrength, s.communityTotalOutStrength, s.communityTotalInStrength);
+    accumulateInternalEdgeWeights(s.graph, s.nodeCommunity, s.n, s.communityInternalEdgeWeight);
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: neighbor accumulation                                   */
+/* ------------------------------------------------------------------ */
+function resetScratch(s) {
+    for (let i = 0; i < s.candidateCommunityCount; i++) {
+        const c = iget(s.candidateCommunities, i);
+        s.isCandidateCommunity[c] = 0;
+        s.neighborEdgeWeightToCommunity[c] = 0;
+        s.outEdgeWeightToCommunity[c] = 0;
+        s.inEdgeWeightFromCommunity[c] = 0;
+    }
+    s.candidateCommunityCount = 0;
+}
+function touchCandidate(s, c) {
+    if (u8get(s.isCandidateCommunity, c))
+        return;
+    s.isCandidateCommunity[c] = 1;
+    s.candidateCommunities[s.candidateCommunityCount++] = c;
+}
+function accumulateNeighborWeights(s, v) {
+    resetScratch(s);
+    const ci = iget(s.nodeCommunity, v);
+    touchCandidate(s, ci);
+    if (s.graph.directed) {
+        const outL = s.graph.outEdges[v];
+        for (let k = 0; k < outL.length; k++) {
+            const j = outL[k].to;
+            const w = outL[k].w;
+            const cj = iget(s.nodeCommunity, j);
+            touchCandidate(s, cj);
+            s.outEdgeWeightToCommunity[cj] = fget(s.outEdgeWeightToCommunity, cj) + w;
+        }
+        const inL = s.graph.inEdges[v];
+        for (let k = 0; k < inL.length; k++) {
+            const i2 = inL[k].from;
+            const w = inL[k].w;
+            const ci2 = iget(s.nodeCommunity, i2);
+            touchCandidate(s, ci2);
+            s.inEdgeWeightFromCommunity[ci2] = fget(s.inEdgeWeightFromCommunity, ci2) + w;
+        }
+    }
+    else {
+        const list = s.graph.outEdges[v];
+        for (let k = 0; k < list.length; k++) {
+            const j = list[k].to;
+            const w = list[k].w;
+            const cj = iget(s.nodeCommunity, j);
+            touchCandidate(s, cj);
+            s.neighborEdgeWeightToCommunity[cj] = fget(s.neighborEdgeWeightToCommunity, cj) + w;
+        }
+    }
+    return s.candidateCommunityCount;
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: modularity delta computations                           */
+/* ------------------------------------------------------------------ */
+function computeDeltaModularityUndirected(s, v, newC, gamma = 1.0) {
+    const oldC = iget(s.nodeCommunity, v);
+    if (newC === oldC)
+        return 0;
+    const twoM = s.graph.totalWeight;
+    const strengthV = fget(s.graph.strengthOut, v);
+    const weightToNew = newC < s.neighborEdgeWeightToCommunity.length
+        ? fget(s.neighborEdgeWeightToCommunity, newC) || 0
+        : 0;
+    const weightToOld = fget(s.neighborEdgeWeightToCommunity, oldC) || 0;
+    const totalStrengthNew = newC < s.communityTotalStrength.length ? fget(s.communityTotalStrength, newC) : 0;
+    const totalStrengthOld = fget(s.communityTotalStrength, oldC);
+    const gain_remove = -(weightToOld / twoM -
+        (gamma * (strengthV * totalStrengthOld)) / (twoM * twoM));
+    const gain_add = weightToNew / twoM - (gamma * (strengthV * totalStrengthNew)) / (twoM * twoM);
+    return gain_remove + gain_add;
+}
+function computeDeltaModularityDirected(s, v, newC, gamma = 1.0) {
+    const oldC = iget(s.nodeCommunity, v);
+    if (newC === oldC)
+        return 0;
+    const totalEdgeWeight = s.graph.totalWeight;
+    const strengthOutV = fget(s.graph.strengthOut, v);
+    const strengthInV = fget(s.graph.strengthIn, v);
+    const inFromNew = newC < s.inEdgeWeightFromCommunity.length ? fget(s.inEdgeWeightFromCommunity, newC) || 0 : 0;
+    const outToNew = newC < s.outEdgeWeightToCommunity.length ? fget(s.outEdgeWeightToCommunity, newC) || 0 : 0;
+    const inFromOld = fget(s.inEdgeWeightFromCommunity, oldC) || 0;
+    const outToOld = fget(s.outEdgeWeightToCommunity, oldC) || 0;
+    const totalInStrengthNew = newC < s.communityTotalInStrength.length ? fget(s.communityTotalInStrength, newC) : 0;
+    const totalOutStrengthNew = newC < s.communityTotalOutStrength.length ? fget(s.communityTotalOutStrength, newC) : 0;
+    const totalInStrengthOld = fget(s.communityTotalInStrength, oldC);
+    const totalOutStrengthOld = fget(s.communityTotalOutStrength, oldC);
+    // Self-loop correction + constant term (see modularity.ts diffModularityDirected)
+    const selfW = fget(s.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 computeDeltaCPM(s, v, newC, gamma = 1.0) {
+    const oldC = iget(s.nodeCommunity, v);
+    if (newC === oldC)
+        return 0;
+    let w_old;
+    let w_new;
+    let selfCorrection = 0;
+    if (s.graph.directed) {
+        w_old =
+            (fget(s.outEdgeWeightToCommunity, oldC) || 0) +
+                (fget(s.inEdgeWeightFromCommunity, oldC) || 0);
+        w_new =
+            newC < s.outEdgeWeightToCommunity.length
+                ? (fget(s.outEdgeWeightToCommunity, newC) || 0) +
+                    (fget(s.inEdgeWeightFromCommunity, newC) || 0)
+                : 0;
+        // Self-loop correction (see cpm.ts diffCPM)
+        selfCorrection = 2 * (fget(s.graph.selfLoop, v) || 0);
+    }
+    else {
+        w_old = fget(s.neighborEdgeWeightToCommunity, oldC) || 0;
+        w_new =
+            newC < s.neighborEdgeWeightToCommunity.length
+                ? fget(s.neighborEdgeWeightToCommunity, newC) || 0
+                : 0;
+    }
+    const nodeSz = fget(s.graph.size, v) || 1;
+    const sizeOld = fget(s.communityTotalSize, oldC) || 0;
+    const sizeNew = newC < s.communityTotalSize.length ? fget(s.communityTotalSize, newC) : 0;
+    return w_new - w_old + selfCorrection - gamma * nodeSz * (sizeNew - sizeOld + nodeSz);
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: node move                                               */
+/* ------------------------------------------------------------------ */
+function moveNode(s, v, newC) {
+    const oldC = iget(s.nodeCommunity, v);
+    if (oldC === newC)
+        return false;
+    if (newC >= s.communityCount) {
+        ensureCommCapacity(s, newC + 1);
+        s.communityCount = newC + 1;
+    }
+    const strengthOutV = fget(s.graph.strengthOut, v);
+    const strengthInV = fget(s.graph.strengthIn, v);
+    const selfLoopWeight = fget(s.graph.selfLoop, v);
+    const nodeSz = fget(s.graph.size, v);
+    s.communityNodeCount[oldC] = iget(s.communityNodeCount, oldC) - 1;
+    s.communityNodeCount[newC] = iget(s.communityNodeCount, newC) + 1;
+    s.communityTotalSize[oldC] = fget(s.communityTotalSize, oldC) - nodeSz;
+    s.communityTotalSize[newC] = fget(s.communityTotalSize, newC) + nodeSz;
+    if (s.graph.directed) {
+        s.communityTotalOutStrength[oldC] = fget(s.communityTotalOutStrength, oldC) - strengthOutV;
+        s.communityTotalOutStrength[newC] = fget(s.communityTotalOutStrength, newC) + strengthOutV;
+        s.communityTotalInStrength[oldC] = fget(s.communityTotalInStrength, oldC) - strengthInV;
+        s.communityTotalInStrength[newC] = fget(s.communityTotalInStrength, newC) + strengthInV;
+    }
+    else {
+        s.communityTotalStrength[oldC] = fget(s.communityTotalStrength, oldC) - strengthOutV;
+        s.communityTotalStrength[newC] = fget(s.communityTotalStrength, newC) + strengthOutV;
+    }
+    if (s.graph.directed) {
+        const outToOld = fget(s.outEdgeWeightToCommunity, oldC) || 0;
+        const inFromOld = fget(s.inEdgeWeightFromCommunity, oldC) || 0;
+        const outToNew = newC < s.outEdgeWeightToCommunity.length ? fget(s.outEdgeWeightToCommunity, newC) || 0 : 0;
+        const inFromNew = newC < s.inEdgeWeightFromCommunity.length ? fget(s.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.
+        s.communityInternalEdgeWeight[oldC] =
+            fget(s.communityInternalEdgeWeight, oldC) - (outToOld + inFromOld - selfLoopWeight);
+        s.communityInternalEdgeWeight[newC] =
+            fget(s.communityInternalEdgeWeight, newC) + (outToNew + inFromNew + selfLoopWeight);
+    }
+    else {
+        const weightToOld = fget(s.neighborEdgeWeightToCommunity, oldC) || 0;
+        const weightToNew = fget(s.neighborEdgeWeightToCommunity, newC) || 0;
+        s.communityInternalEdgeWeight[oldC] =
+            fget(s.communityInternalEdgeWeight, oldC) - (2 * weightToOld + selfLoopWeight);
+        s.communityInternalEdgeWeight[newC] =
+            fget(s.communityInternalEdgeWeight, newC) + (2 * weightToNew + selfLoopWeight);
+    }
+    s.nodeCommunity[v] = newC;
+    return true;
+}
+/* ------------------------------------------------------------------ */
+/*  Extracted: community compaction                                    */
+/* ------------------------------------------------------------------ */
+function compactIds(s, opts = {}) {
+    const ids = [];
+    for (let c = 0; c < s.communityCount; c++)
+        if (iget(s.communityNodeCount, c) > 0)
+            ids.push(c);
+    buildSortedCommunityIds(ids, opts, s.communityTotalSize, s.communityNodeCount);
+    const newId = new Int32Array(s.communityCount).fill(-1);
+    ids.forEach((c, i) => {
+        newId[c] = i;
+    });
+    for (let i = 0; i < s.nodeCommunity.length; i++)
+        s.nodeCommunity[i] = iget(newId, iget(s.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);
+    accumulateNodeAggregates(s.graph, s.nodeCommunity, s.n, newTotalSize, newNodeCount, newInternalEdgeWeight, newTotalStrength, newTotalOutStrength, newTotalInStrength);
+    accumulateInternalEdgeWeights(s.graph, s.nodeCommunity, s.n, newInternalEdgeWeight);
+    s.communityCount = remappedCount;
+    s.communityTotalSize = newTotalSize;
+    s.communityNodeCount = newNodeCount;
+    s.communityInternalEdgeWeight = newInternalEdgeWeight;
+    s.communityTotalStrength = newTotalStrength;
+    s.communityTotalOutStrength = newTotalOutStrength;
+    s.communityTotalInStrength = newTotalInStrength;
+}
+/* ------------------------------------------------------------------ */
+/*  Factory: thin wrapper that wires state to extracted functions      */
+/* ------------------------------------------------------------------ */
+export function makePartition(graph) {
+    const n = graph.n;
+    const nodeCommunity = new Int32Array(n);
+    for (let i = 0; i < n; i++)
+        nodeCommunity[i] = i;
+    const s = {
+        graph,
+        n,
+        nodeCommunity,
+        communityCount: n,
+        communityTotalSize: new Float64Array(n),
+        communityNodeCount: new Int32Array(n),
+        communityInternalEdgeWeight: new Float64Array(n),
+        communityTotalStrength: new Float64Array(n),
+        communityTotalOutStrength: new Float64Array(n),
+        communityTotalInStrength: new Float64Array(n),
+        candidateCommunities: new Int32Array(n),
+        candidateCommunityCount: 0,
+        neighborEdgeWeightToCommunity: new Float64Array(n),
+        outEdgeWeightToCommunity: new Float64Array(n),
+        inEdgeWeightFromCommunity: new Float64Array(n),
+        isCandidateCommunity: new Uint8Array(n),
+    };
+    return {
+        n,
+        get communityCount() {
+            return s.communityCount;
+        },
+        nodeCommunity,
+        get communityTotalSize() {
+            return s.communityTotalSize;
+        },
+        get communityNodeCount() {
+            return s.communityNodeCount;
+        },
+        get communityInternalEdgeWeight() {
+            return s.communityInternalEdgeWeight;
+        },
+        get communityTotalStrength() {
+            return s.communityTotalStrength;
+        },
+        get communityTotalOutStrength() {
+            return s.communityTotalOutStrength;
+        },
+        get communityTotalInStrength() {
+            return s.communityTotalInStrength;
+        },
+        resizeCommunities(newCount) {
+            ensureCommCapacity(s, newCount);
+            s.communityCount = newCount;
+        },
+        initializeAggregates: () => initAggregates(s),
+        accumulateNeighborCommunityEdgeWeights: (v) => accumulateNeighborWeights(s, v),
+        getCandidateCommunityCount: () => s.candidateCommunityCount,
+        getCandidateCommunityAt: (i) => iget(s.candidateCommunities, i),
+        getNeighborEdgeWeightToCommunity: (c) => fget(s.neighborEdgeWeightToCommunity, c) || 0,
+        getOutEdgeWeightToCommunity: (c) => fget(s.outEdgeWeightToCommunity, c) || 0,
+        getInEdgeWeightFromCommunity: (c) => fget(s.inEdgeWeightFromCommunity, c) || 0,
+        deltaModularityUndirected: (v, newC, gamma) => computeDeltaModularityUndirected(s, v, newC, gamma),
+        deltaModularityDirected: (v, newC, gamma) => computeDeltaModularityDirected(s, v, newC, gamma),
+        deltaCPM: (v, newC, gamma) => computeDeltaCPM(s, v, newC, gamma),
+        moveNodeToCommunity: (v, newC) => moveNode(s, v, newC),
+        compactCommunityIds: (opts) => compactIds(s, opts),
+        getCommunityMembers() {
+            const comms = new Array(s.communityCount);
+            for (let i = 0; i < s.communityCount; i++)
+                comms[i] = [];
+            for (let i = 0; i < n; i++)
+                comms[iget(nodeCommunity, i)].push(i);
+            return comms;
+        },
+        getCommunityTotalSize: (c) => c < s.communityTotalSize.length ? fget(s.communityTotalSize, c) : 0,
+        getCommunityNodeCount: (c) => c < s.communityNodeCount.length ? iget(s.communityNodeCount, c) : 0,
+        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;AA0BD,wEAAwE;AACxE,wEAAwE;AACxE,wEAAwE;AAExE;;;;GAIG;AACH,SAAS,wBAAwB,CAC/B,KAAmB,EACnB,aAAyB,EACzB,CAAS,EACT,SAAuB,EACvB,SAAqB,EACrB,kBAAgC,EAChC,aAA2B,EAC3B,gBAA8B,EAC9B,eAA6B;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QACzC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxD,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC7E,eAAe,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACN,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC;YAC/B,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAClF,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,6BAA6B,CACpC,KAAmB,EACnB,aAAyB,EACzB,CAAS,EACT,kBAAgC;IAEhC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS,CAAC,kDAAkD;gBACzE,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBAC/B,kBAAkB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAW,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACrB,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBAC/B,kBAAkB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,uBAAuB,CAC9B,GAAa,EACb,IAAoB,EACpB,kBAAgC,EAChC,kBAA8B;IAE9B,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC;SAAM,IAAI,IAAI,CAAC,WAAW,YAAY,GAAG,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAChB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,KAAK,EAAE;gBAAE,OAAO,EAAE,GAAG,EAAE,CAAC;YAC1D,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI;gBAAE,OAAO,CAAC,CAAC,CAAC;YACxC,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI;gBAAE,OAAO,CAAC,CAAC;YACvC,OAAO,CACL,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,CACN,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;YACzD,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;YACzD,CAAC,GAAG,CAAC,CACR,CAAC;IACJ,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,kBAAkB,CAAC,CAAiB,EAAE,QAAgB;IAC7D,IAAI,QAAQ,IAAI,CAAC,CAAC,kBAAkB,CAAC,MAAM;QAAE,OAAO;IACpD,MAAM,MAAM,GAAW,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;IACxF,CAAC,CAAC,kBAAkB,GAAG,SAAS,CAAC,CAAC,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;IAC/D,CAAC,CAAC,kBAAkB,GAAG,OAAO,CAAC,CAAC,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC,CAAC,2BAA2B,GAAG,SAAS,CAAC,CAAC,CAAC,2BAA2B,EAAE,MAAM,CAAC,CAAC;IACjF,CAAC,CAAC,sBAAsB,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC;IACvE,CAAC,CAAC,yBAAyB,GAAG,SAAS,CAAC,CAAC,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;IAC7E,CAAC,CAAC,wBAAwB,GAAG,SAAS,CAAC,CAAC,CAAC,wBAAwB,EAAE,MAAM,CAAC,CAAC;AAC7E,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,cAAc,CAAC,CAAiB;IACvC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,wBAAwB,CACtB,CAAC,CAAC,KAAK,EACP,CAAC,CAAC,aAAa,EACf,CAAC,CAAC,CAAC,EACH,CAAC,CAAC,kBAAkB,EACpB,CAAC,CAAC,kBAAkB,EACpB,CAAC,CAAC,2BAA2B,EAC7B,CAAC,CAAC,sBAAsB,EACxB,CAAC,CAAC,yBAAyB,EAC3B,CAAC,CAAC,wBAAwB,CAC3B,CAAC;IACF,6BAA6B,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,2BAA2B,CAAC,CAAC;AAC9F,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,YAAY,CAAC,CAAiB;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,uBAAuB,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC,CAAC,6BAA6B,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,CAAC,CAAC,uBAAuB,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,cAAc,CAAC,CAAiB,EAAE,CAAS;IAClD,IAAI,KAAK,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAAE,OAAO;IAC7C,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,uBAAuB,EAAE,CAAC,GAAG,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,yBAAyB,CAAC,CAAiB,EAAE,CAAS;IAC7D,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,EAAE,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC5C,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC5C,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtB,CAAC,CAAC,wBAAwB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,EAAE,GAAW,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC;YAChC,MAAM,CAAC,GAAW,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,GAAG,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;YAC9C,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC,CAAC,yBAAyB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAW,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC5C,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtB,CAAC,CAAC,6BAA6B,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACtF,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,uBAAuB,CAAC;AACnC,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,gCAAgC,CACvC,CAAiB,EACjB,CAAS,EACT,IAAY,EACZ,QAAgB,GAAG;IAEnB,MAAM,IAAI,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAW,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC;IACzC,MAAM,SAAS,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,WAAW,GACf,IAAI,GAAG,CAAC,CAAC,6BAA6B,CAAC,MAAM;QAC3C,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC;QAClD,CAAC,CAAC,CAAC,CAAC;IACR,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,MAAM,gBAAgB,GACpB,IAAI,GAAG,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,gBAAgB,GAAW,IAAI,CAAC,CAAC,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC;IACtE,MAAM,WAAW,GAAW,CAAC,CAC3B,WAAW,GAAG,IAAI;QAClB,CAAC,KAAK,GAAG,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CACzD,CAAC;IACF,MAAM,QAAQ,GACZ,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IAChF,OAAO,WAAW,GAAG,QAAQ,CAAC;AAChC,CAAC;AAED,SAAS,8BAA8B,CACrC,CAAiB,EACjB,CAAS,EACT,IAAY,EACZ,QAAgB,GAAG;IAEnB,MAAM,IAAI,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAC5B,MAAM,eAAe,GAAW,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC;IACpD,MAAM,YAAY,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GACb,IAAI,GAAG,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,MAAM,QAAQ,GACZ,IAAI,GAAG,CAAC,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,SAAS,GAAW,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAW,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,MAAM,kBAAkB,GACtB,IAAI,GAAG,CAAC,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,mBAAmB,GACvB,IAAI,GAAG,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,kBAAkB,GAAW,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;IAC1E,MAAM,mBAAmB,GAAW,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,CAAC;IAC5E,kFAAkF;IAClF,MAAM,KAAK,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,MAAM,aAAa,GACjB,CAAC,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe,CAAC;IAC9E,MAAM,aAAa,GACjB,CAAC,KAAK;QACJ,CAAC,YAAY,GAAG,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;YACvD,WAAW,GAAG,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;YACzD,CAAC,GAAG,YAAY,GAAG,WAAW,CAAC,CAAC;QACpC,CAAC,eAAe,GAAG,eAAe,CAAC,CAAC;IACtC,OAAO,aAAa,GAAG,aAAa,CAAC;AACvC,CAAC;AAED,SAAS,eAAe,CAAC,CAAiB,EAAE,CAAS,EAAE,IAAY,EAAE,QAAgB,GAAG;IACtF,MAAM,IAAI,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,KAAa,CAAC;IAClB,IAAI,KAAa,CAAC;IAClB,IAAI,cAAc,GAAW,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrB,KAAK;YACH,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACjD,KAAK;YACH,IAAI,GAAG,CAAC,CAAC,wBAAwB,CAAC,MAAM;gBACtC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7C,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChD,CAAC,CAAC,CAAC,CAAC;QACR,4CAA4C;QAC5C,cAAc,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,KAAK;YACH,IAAI,GAAG,CAAC,CAAC,6BAA6B,CAAC,MAAM;gBAC3C,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC;gBAClD,CAAC,CAAC,CAAC,CAAC;IACV,CAAC;IACD,MAAM,MAAM,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,OAAO,GAAW,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAW,IAAI,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,OAAO,KAAK,GAAG,KAAK,GAAG,cAAc,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC;AACxF,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,QAAQ,CAAC,CAAiB,EAAE,CAAS,EAAE,IAAY;IAC1D,MAAM,IAAI,GAAW,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAChC,IAAI,IAAI,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;QAC7B,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,YAAY,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,cAAc,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,MAAM,GAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE7C,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAClE,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAClE,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC;IACvE,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC;IACvE,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrB,CAAC,CAAC,yBAAyB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;QAC3F,CAAC,CAAC,yBAAyB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;QAC3F,CAAC,CAAC,wBAAwB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC;QACxF,CAAC,CAAC,wBAAwB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC;IAC1F,CAAC;SAAM,CAAC;QACN,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,sBAAsB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;QACrF,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,sBAAsB,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;IACvF,CAAC;IAED,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAW,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,SAAS,GAAW,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,MAAM,QAAQ,GACZ,IAAI,GAAG,CAAC,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7F,MAAM,SAAS,GACb,IAAI,GAAG,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,0EAA0E;QAC1E,sEAAsE;QACtE,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,GAAG,cAAc,CAAC,CAAC;QACtF,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,GAAG,cAAc,CAAC,CAAC;IACxF,CAAC;SAAM,CAAC;QACN,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7E,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7E,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,cAAc,CAAC,CAAC;QACjF,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,2BAA2B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,cAAc,CAAC,CAAC;IACnF,CAAC;IAED,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAC1B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,SAAS,UAAU,CAAC,CAAiB,EAAE,OAAuB,EAAE;IAC9D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9F,uBAAuB,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,kBAAkB,CAAC,CAAC;IAE/E,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;QAC7C,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;IAE7D,MAAM,aAAa,GAAW,GAAG,CAAC,MAAM,CAAC;IACzC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC;IACnD,MAAM,qBAAqB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,gBAAgB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IACzD,MAAM,mBAAmB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IAC5D,MAAM,kBAAkB,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC;IAC3D,wBAAwB,CACtB,CAAC,CAAC,KAAK,EACP,CAAC,CAAC,aAAa,EACf,CAAC,CAAC,CAAC,EACH,YAAY,EACZ,YAAY,EACZ,qBAAqB,EACrB,gBAAgB,EAChB,mBAAmB,EACnB,kBAAkB,CACnB,CAAC;IACF,6BAA6B,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;IAEpF,CAAC,CAAC,cAAc,GAAG,aAAa,CAAC;IACjC,CAAC,CAAC,kBAAkB,GAAG,YAAY,CAAC;IACpC,CAAC,CAAC,kBAAkB,GAAG,YAAY,CAAC;IACpC,CAAC,CAAC,2BAA2B,GAAG,qBAAqB,CAAC;IACtD,CAAC,CAAC,sBAAsB,GAAG,gBAAgB,CAAC;IAC5C,CAAC,CAAC,yBAAyB,GAAG,mBAAmB,CAAC;IAClD,CAAC,CAAC,wBAAwB,GAAG,kBAAkB,CAAC;AAClD,CAAC;AAED,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,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;IAEjD,MAAM,CAAC,GAAmB;QACxB,KAAK;QACL,CAAC;QACD,aAAa;QACb,cAAc,EAAE,CAAC;QACjB,kBAAkB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACvC,kBAAkB,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC;QACrC,2BAA2B,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAChD,sBAAsB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAC3C,yBAAyB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAC9C,wBAAwB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAC7C,oBAAoB,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC;QACvC,uBAAuB,EAAE,CAAC;QAC1B,6BAA6B,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAClD,wBAAwB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAC7C,yBAAyB,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QAC9C,oBAAoB,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC;KACxC,CAAC;IAEF,OAAO;QACL,CAAC;QACD,IAAI,cAAc;YAChB,OAAO,CAAC,CAAC,cAAc,CAAC;QAC1B,CAAC;QACD,aAAa;QACb,IAAI,kBAAkB;YACpB,OAAO,CAAC,CAAC,kBAAkB,CAAC;QAC9B,CAAC;QACD,IAAI,kBAAkB;YACpB,OAAO,CAAC,CAAC,kBAAkB,CAAC;QAC9B,CAAC;QACD,IAAI,2BAA2B;YAC7B,OAAO,CAAC,CAAC,2BAA2B,CAAC;QACvC,CAAC;QACD,IAAI,sBAAsB;YACxB,OAAO,CAAC,CAAC,sBAAsB,CAAC;QAClC,CAAC;QACD,IAAI,yBAAyB;YAC3B,OAAO,CAAC,CAAC,yBAAyB,CAAC;QACrC,CAAC;QACD,IAAI,wBAAwB;YAC1B,OAAO,CAAC,CAAC,wBAAwB,CAAC;QACpC,CAAC;QACD,iBAAiB,CAAC,QAAgB;YAChC,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChC,CAAC,CAAC,cAAc,GAAG,QAAQ,CAAC;QAC9B,CAAC;QACD,oBAAoB,EAAE,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC;QAC7C,sCAAsC,EAAE,CAAC,CAAS,EAAE,EAAE,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC;QACtF,0BAA0B,EAAE,GAAW,EAAE,CAAC,CAAC,CAAC,uBAAuB;QACnE,uBAAuB,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAC/E,gCAAgC,EAAE,CAAC,CAAS,EAAU,EAAE,CACtD,IAAI,CAAC,CAAC,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC;QAC/C,2BAA2B,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,EAAE,CAAC,CAAC,IAAI,CAAC;QAC5F,4BAA4B,EAAE,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,CAAC,CAAC,IAAI,CAAC;QAC9F,yBAAyB,EAAE,CAAC,CAAS,EAAE,IAAY,EAAE,KAAc,EAAE,EAAE,CACrE,gCAAgC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;QACrD,uBAAuB,EAAE,CAAC,CAAS,EAAE,IAAY,EAAE,KAAc,EAAE,EAAE,CACnE,8BAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;QACnD,QAAQ,EAAE,CAAC,CAAS,EAAE,IAAY,EAAE,KAAc,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;QACzF,mBAAmB,EAAE,CAAC,CAAS,EAAE,IAAY,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;QACtE,mBAAmB,EAAE,CAAC,IAAqB,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC;QACnE,mBAAmB;YACjB,MAAM,KAAK,GAAe,IAAI,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,qBAAqB,EAAE,CAAC,CAAS,EAAU,EAAE,CAC3C,CAAC,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,qBAAqB,EAAE,CAAC,CAAS,EAAU,EAAE,CAC3C,CAAC,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,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

@@ -0,0 +1,20 @@
+/**
+ * Community detection via native Rust Louvain or vendored Leiden algorithm.
+ * Maintains backward-compatible API: { assignments: Map<string, number>, modularity: number }
+ *
+ * Native path: classic Louvain (Rust, undirected modularity optimization).
+ * JS fallback: Leiden algorithm via `detectClusters` (always undirected, `directed: false`).
+ */
+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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAO7C,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,CAyB7F"}

package/dist/graph/algorithms/louvain.js

@@ -0,0 +1,52 @@
+/**
+ * Community detection via native Rust Louvain or vendored Leiden algorithm.
+ * Maintains backward-compatible API: { assignments: Map<string, number>, modularity: number }
+ *
+ * Native path: classic Louvain (Rust, undirected modularity optimization).
+ * JS fallback: Leiden algorithm via `detectClusters` (always undirected, `directed: false`).
+ */
+import { debug } from '../../infrastructure/logger.js';
+import { loadNative } from '../../infrastructure/native.js';
+import { detectClusters } from './leiden/index.js';
+/** Default random seed for deterministic community detection. */
+const DEFAULT_RANDOM_SEED = 42;
+export function louvainCommunities(graph, opts = {}) {
+    if (graph.nodeCount === 0 || graph.edgeCount === 0) {
+        return { assignments: new Map(), modularity: 0 };
+    }
+    const resolution = opts.resolution ?? 1.0;
+    const native = loadNative();
+    if (native?.louvainCommunities) {
+        if (opts.maxLevels != null || opts.maxLocalPasses != null || opts.refinementTheta != null) {
+            debug('louvainCommunities: maxLevels/maxLocalPasses/refinementTheta are ignored by the native Rust path');
+        }
+        const edges = graph.toEdgeArray();
+        const nodeIds = graph.nodeIds();
+        const result = native.louvainCommunities(edges, nodeIds, resolution, DEFAULT_RANDOM_SEED);
+        const assignments = new Map();
+        for (const entry of result.assignments) {
+            assignments.set(entry.node, entry.community);
+        }
+        return { assignments, modularity: result.modularity };
+    }
+    return louvainJS(graph, opts, resolution);
+}
+/** JS fallback using the vendored Leiden algorithm. */
+function louvainJS(graph, opts, resolution) {
+    const result = detectClusters(graph, {
+        resolution,
+        randomSeed: DEFAULT_RANDOM_SEED,
+        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 [id] of graph.nodes()) {
+        const cls = result.getClass(id);
+        if (cls != null)
+            assignments.set(id, cls);
+    }
+    return { assignments, modularity: result.quality() };
+}
+//# sourceMappingURL=louvain.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gCAAgC,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAG5D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD,iEAAiE;AACjE,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAc/B,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;IAElD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,MAAM,EAAE,kBAAkB,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC;YAC1F,KAAK,CACH,kGAAkG,CACnG,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,mBAAmB,CAAC,CAAC;QAC1F,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;IACxD,CAAC;IAED,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAC5C,CAAC;AAED,uDAAuD;AACvD,SAAS,SAAS,CAAC,KAAgB,EAAE,IAAoB,EAAE,UAAkB;IAC3E,MAAM,MAAM,GAAyB,cAAc,CAAC,KAAK,EAAE;QACzD,UAAU;QACV,UAAU,EAAE,mBAAmB;QAC/B,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

@@ -0,0 +1,10 @@
+import type { CodeGraph } from '../model.js';
+/**
+ * BFS-based shortest path on a CodeGraph.
+ *
+ * Tries the native Rust implementation first, falls back to JS.
+ *
+ * @returns Path from fromId to toId (inclusive), or null if unreachable
+ */
+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

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAoB5F"}