@monoes/monograph 1.1.0 → 1.2.0

package/dist/src/graph/cycle-detection.js

@@ -0,0 +1,210 @@
+function canonicalCycle(cycle, idToPath) {
+    if (cycle.length === 0)
+        return [];
+    let minPos = 0;
+    let minPath = idToPath.get(cycle[0]) ?? '';
+    for (let i = 1; i < cycle.length; i++) {
+        const p = idToPath.get(cycle[i]) ?? '';
+        if (p < minPath) {
+            minPath = p;
+            minPos = i;
+        }
+    }
+    return [...cycle.slice(minPos), ...cycle.slice(0, minPos)];
+}
+function tryRecordCycle(path, idToPath, seen, cycles) {
+    const canonical = canonicalCycle(path, idToPath);
+    const key = canonical.join(',');
+    if (seen.has(key))
+        return;
+    seen.add(key);
+    cycles.push(canonical);
+}
+function dfsFindCyclesFrom(start, depthLimit, sccSet, allSuccs, succRanges, maxCycles, seen, cycles, idToPath) {
+    const path = [start];
+    const pathSet = new Set([start]);
+    const range = succRanges.get(start) ?? [0, 0];
+    const dfs = [{ succPos: range[0], succEnd: range[1] }];
+    while (dfs.length > 0) {
+        if (cycles.length >= maxCycles)
+            return;
+        const frame = dfs[dfs.length - 1];
+        if (frame.succPos >= frame.succEnd) {
+            dfs.pop();
+            if (path.length > 1) {
+                const removed = path.pop();
+                pathSet.delete(removed);
+            }
+            continue;
+        }
+        const w = allSuccs[frame.succPos];
+        frame.succPos++;
+        if (!sccSet.has(w))
+            continue;
+        if (w === start && path.length >= 2 && path.length === depthLimit) {
+            tryRecordCycle(path, idToPath, seen, cycles);
+            continue;
+        }
+        if (pathSet.has(w) || path.length >= depthLimit)
+            continue;
+        path.push(w);
+        pathSet.add(w);
+        const wRange = succRanges.get(w) ?? [0, 0];
+        dfs.push({ succPos: wRange[0], succEnd: wRange[1] });
+    }
+}
+function enumerateElementaryCycles(sccNodes, allSuccs, succRanges, maxCycles, idToPath, skipTypeOnly, typeOnlyEdges) {
+    const sccSet = new Set(sccNodes);
+    const cycles = [];
+    const seen = new Set();
+    const sortedNodes = [...sccNodes].sort((a, b) => {
+        const pa = idToPath.get(a) ?? '';
+        const pb = idToPath.get(b) ?? '';
+        return pa < pb ? -1 : pa > pb ? 1 : 0;
+    });
+    const maxDepth = Math.min(sccNodes.length, 12);
+    for (let depthLimit = 2; depthLimit <= maxDepth; depthLimit++) {
+        if (cycles.length >= maxCycles)
+            break;
+        for (const start of sortedNodes) {
+            if (cycles.length >= maxCycles)
+                break;
+            dfsFindCyclesFrom(start, depthLimit, sccSet, allSuccs, succRanges, maxCycles, seen, cycles, idToPath);
+        }
+    }
+    return cycles;
+}
+export function findCycles(fileIds, edges, idToPath, skipTypeOnly = false, typeOnlyEdges = new Set()) {
+    const n = fileIds.length;
+    if (n === 0)
+        return [];
+    const idIndex = new Map();
+    for (let i = 0; i < fileIds.length; i++) {
+        idIndex.set(fileIds[i], i);
+    }
+    const allSuccs = [];
+    const succRanges = new Map();
+    for (const id of fileIds) {
+        const start = allSuccs.length;
+        const seen = new Set();
+        const neighbors = edges.get(id) ?? [];
+        for (const neighbor of neighbors) {
+            if (skipTypeOnly && typeOnlyEdges.has(`${id}→${neighbor}`))
+                continue;
+            if (idIndex.has(neighbor) && !seen.has(neighbor)) {
+                seen.add(neighbor);
+                allSuccs.push(neighbor);
+            }
+        }
+        succRanges.set(id, [start, allSuccs.length]);
+    }
+    const UNDEF = 0xffffffff;
+    const indices = new Array(n).fill(UNDEF);
+    const lowlinks = new Array(n).fill(0);
+    const onStack = new Array(n).fill(false);
+    const stack = [];
+    const sccs = [];
+    let indexCounter = 0;
+    const dfsStack = [];
+    for (let startI = 0; startI < n; startI++) {
+        if (indices[startI] !== UNDEF)
+            continue;
+        const startId = fileIds[startI];
+        indices[startI] = indexCounter;
+        lowlinks[startI] = indexCounter;
+        indexCounter++;
+        onStack[startI] = true;
+        stack.push(startI);
+        const startRange = succRanges.get(startId) ?? [0, 0];
+        dfsStack.push({ node: startI, succPos: startRange[0], succEnd: startRange[1] });
+        while (dfsStack.length > 0) {
+            const frame = dfsStack[dfsStack.length - 1];
+            if (frame.succPos < frame.succEnd) {
+                const wId = allSuccs[frame.succPos];
+                frame.succPos++;
+                const wI = idIndex.get(wId);
+                if (wI === undefined)
+                    continue;
+                if (indices[wI] === UNDEF) {
+                    indices[wI] = indexCounter;
+                    lowlinks[wI] = indexCounter;
+                    indexCounter++;
+                    onStack[wI] = true;
+                    stack.push(wI);
+                    const wId2 = fileIds[wI];
+                    const wRange = succRanges.get(wId2) ?? [0, 0];
+                    dfsStack.push({ node: wI, succPos: wRange[0], succEnd: wRange[1] });
+                }
+                else if (onStack[wI]) {
+                    const v = frame.node;
+                    if (indices[wI] < lowlinks[v]) {
+                        lowlinks[v] = indices[wI];
+                    }
+                }
+            }
+            else {
+                const v = frame.node;
+                const vLowlink = lowlinks[v];
+                const vIndex = indices[v];
+                dfsStack.pop();
+                if (dfsStack.length > 0) {
+                    const parent = dfsStack[dfsStack.length - 1];
+                    if (vLowlink < lowlinks[parent.node]) {
+                        lowlinks[parent.node] = vLowlink;
+                    }
+                }
+                if (vLowlink === vIndex) {
+                    const scc = [];
+                    while (true) {
+                        const w = stack.pop();
+                        onStack[w] = false;
+                        scc.push(fileIds[w]);
+                        if (w === v)
+                            break;
+                    }
+                    if (scc.length >= 2) {
+                        sccs.push(scc);
+                    }
+                }
+            }
+        }
+    }
+    const MAX_CYCLES_PER_SCC = 20;
+    const result = [];
+    const seenCycles = new Set();
+    for (const scc of sccs) {
+        if (scc.length === 2) {
+            const pathA = idToPath.get(scc[0]) ?? '';
+            const pathB = idToPath.get(scc[1]) ?? '';
+            const cycle = pathA <= pathB ? [scc[0], scc[1]] : [scc[1], scc[0]];
+            const key = cycle.join(',');
+            if (!seenCycles.has(key)) {
+                seenCycles.add(key);
+                result.push(cycle);
+            }
+            continue;
+        }
+        const elementary = enumerateElementaryCycles(scc, allSuccs, succRanges, MAX_CYCLES_PER_SCC, idToPath, skipTypeOnly, typeOnlyEdges);
+        for (const cycle of elementary) {
+            const key = cycle.join(',');
+            if (!seenCycles.has(key)) {
+                seenCycles.add(key);
+                result.push(cycle);
+            }
+        }
+    }
+    result.sort((a, b) => {
+        if (a.length !== b.length)
+            return a.length - b.length;
+        const pa = idToPath.get(a[0]) ?? '';
+        const pb = idToPath.get(b[0]) ?? '';
+        return pa < pb ? -1 : pa > pb ? 1 : 0;
+    });
+    return result.map(cycle => ({
+        files: [...cycle]
+            .sort((a, b) => (idToPath.get(a) ?? '').localeCompare(idToPath.get(b) ?? ''))
+            .map(id => idToPath.get(id) ?? String(id)),
+        length: cycle.length,
+    }));
+}
+//# sourceMappingURL=cycle-detection.js.map

package/dist/src/graph/cycle-detection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-detection.js","sourceRoot":"","sources":["../../../src/graph/cycle-detection.ts"],"names":[],"mappings":"AAgBA,SAAS,cAAc,CAAC,KAAe,EAAE,QAA6B;IACpE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC;YACZ,MAAM,GAAG,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,cAAc,CACrB,IAAc,EACd,QAA6B,EAC7B,IAAiB,EACjB,MAAkB;IAElB,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAa,EACb,UAAkB,EAClB,MAAmB,EACnB,QAAkB,EAClB,UAAyC,EACzC,SAAiB,EACjB,IAAiB,EACjB,MAAkB,EAClB,QAA6B;IAE7B,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAiB,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAErE,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;YAAE,OAAO;QAEvC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,GAAG,CAAC,GAAG,EAAE,CAAC;YACV,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;gBAC5B,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC;YACD,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClC,KAAK,CAAC,OAAO,EAAE,CAAC;QAEhB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAE7B,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAClE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YAC7C,SAAS;QACX,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU;YAAE,SAAS;QAE1D,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED,SAAS,yBAAyB,CAChC,QAAkB,EAClB,QAAkB,EAClB,UAAyC,EACzC,SAAiB,EACjB,QAA6B,EAC7B,YAAqB,EACrB,aAA0B;IAE1B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9C,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC/C,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,IAAI,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;QAC9D,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;YAAE,MAAM;QACtC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;gBAAE,MAAM;YACtC,iBAAiB,CACf,KAAK,EACL,UAAU,EACV,MAAM,EACN,QAAQ,EACR,UAAU,EACV,SAAS,EACT,IAAI,EACJ,MAAM,EACN,QAAQ,CACT,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,UAAU,CACxB,OAAiB,EACjB,KAA4B,EAC5B,QAA6B,EAC7B,YAAY,GAAG,KAAK,EACpB,gBAA6B,IAAI,GAAG,EAAE;IAEtC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IAEvD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,YAAY,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAAE,SAAS;YACrE,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC;IACzB,MAAM,OAAO,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAc,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,MAAM,QAAQ,GAAkB,EAAE,CAAC;IAEnC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;QAC1C,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK;YAAE,SAAS;QAExC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAChC,OAAO,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC;QAC/B,QAAQ,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC;QAChC,YAAY,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnB,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEhF,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,EAAE,CAAC;gBAEhB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAS;gBAE/B,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;oBAC1B,OAAO,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC;oBAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC;oBAC5B,YAAY,EAAE,CAAC;oBACf,OAAO,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;oBACnB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAEf,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;oBACzB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtE,CAAC;qBAAM,IAAI,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;oBACrB,IAAI,OAAO,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC9B,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;oBAC5B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;gBACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,QAAQ,CAAC,GAAG,EAAE,CAAC;gBAEf,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC7C,IAAI,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;oBACnC,CAAC;gBACH,CAAC;gBAED,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;oBACxB,MAAM,GAAG,GAAa,EAAE,CAAC;oBACzB,OAAO,IAAI,EAAE,CAAC;wBACZ,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;wBACvB,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;wBACnB,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;wBACrB,IAAI,CAAC,KAAK,CAAC;4BAAE,MAAM;oBACrB,CAAC;oBACD,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;wBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,kBAAkB,GAAG,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YACD,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,yBAAyB,CAC1C,GAAG,EACH,QAAQ,EACR,UAAU,EACV,kBAAkB,EAClB,QAAQ,EACR,YAAY,EACZ,aAAa,CACd,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACtD,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;aAC5E,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5C,MAAM,EAAE,KAAK,CAAC,MAAM;KACrB,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/src/graph/cycles.d.ts

@@ -0,0 +1,23 @@
+import type { MonographDb } from '../storage/db.js';
+/**
+ * Find ALL strongly connected components (SCCs) using Kosaraju's algorithm.
+ *
+ * Returns every SCC, including singleton components (single nodes with no self-loop).
+ * This is the full SCC decomposition of the graph.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of SCCs; each SCC is an array of node ids in that component.
+ */
+export declare function findStronglyConnectedComponents(db: MonographDb): string[][];
+/**
+ * Find all strongly connected components (SCCs) with more than 1 node,
+ * or self-loops, and return them as cycle node lists.
+ *
+ * Uses Kosaraju's algorithm to find SCCs. Each SCC with size > 1 represents
+ * a cycle. Self-loops (node -> itself) are also detected separately.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of cycles; each cycle is an array of node ids participating in it.
+ */
+export declare function findCycles(db: MonographDb): string[][];
+//# sourceMappingURL=cycles.d.ts.map

package/dist/src/graph/cycles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../../../src/graph/cycles.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD;;;;;;;;GAQG;AACH,wBAAgB,+BAA+B,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,EAAE,EAAE,CA8D3E;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,EAAE,EAAE,CA6EtD"}

package/dist/src/graph/cycles.js

@@ -0,0 +1,142 @@
+/**
+ * Find ALL strongly connected components (SCCs) using Kosaraju's algorithm.
+ *
+ * Returns every SCC, including singleton components (single nodes with no self-loop).
+ * This is the full SCC decomposition of the graph.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of SCCs; each SCC is an array of node ids in that component.
+ */
+export function findStronglyConnectedComponents(db) {
+    const nodeRows = db.prepare('SELECT id FROM nodes').all();
+    const edgeRows = db.prepare('SELECT source_id, target_id FROM edges').all();
+    if (nodeRows.length === 0)
+        return [];
+    const nodes = nodeRows.map(r => r.id);
+    const nodeSet = new Set(nodes);
+    const adj = new Map();
+    const radj = new Map();
+    for (const n of nodes) {
+        adj.set(n, []);
+        radj.set(n, []);
+    }
+    for (const { source_id: src, target_id: tgt } of edgeRows) {
+        if (!nodeSet.has(src) || !nodeSet.has(tgt))
+            continue;
+        if (src === tgt)
+            continue;
+        adj.get(src).push(tgt);
+        radj.get(tgt).push(src);
+    }
+    const visited = new Set();
+    const finishOrder = [];
+    function dfs1(node) {
+        visited.add(node);
+        for (const neighbor of adj.get(node) ?? []) {
+            if (!visited.has(neighbor))
+                dfs1(neighbor);
+        }
+        finishOrder.push(node);
+    }
+    for (const node of nodes) {
+        if (!visited.has(node))
+            dfs1(node);
+    }
+    const assigned = new Set();
+    const sccs = [];
+    function dfs2(node, component) {
+        assigned.add(node);
+        component.push(node);
+        for (const neighbor of radj.get(node) ?? []) {
+            if (!assigned.has(neighbor))
+                dfs2(neighbor, component);
+        }
+    }
+    for (let i = finishOrder.length - 1; i >= 0; i--) {
+        const node = finishOrder[i];
+        if (!assigned.has(node)) {
+            const component = [];
+            dfs2(node, component);
+            sccs.push(component);
+        }
+    }
+    return sccs;
+}
+/**
+ * Find all strongly connected components (SCCs) with more than 1 node,
+ * or self-loops, and return them as cycle node lists.
+ *
+ * Uses Kosaraju's algorithm to find SCCs. Each SCC with size > 1 represents
+ * a cycle. Self-loops (node -> itself) are also detected separately.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of cycles; each cycle is an array of node ids participating in it.
+ */
+export function findCycles(db) {
+    const nodeRows = db.prepare('SELECT id FROM nodes').all();
+    const edgeRows = db.prepare('SELECT source_id, target_id FROM edges').all();
+    if (nodeRows.length === 0)
+        return [];
+    const nodes = nodeRows.map(r => r.id);
+    const nodeSet = new Set(nodes);
+    // Build adjacency list and reverse adjacency list
+    const adj = new Map();
+    const radj = new Map();
+    for (const n of nodes) {
+        adj.set(n, []);
+        radj.set(n, []);
+    }
+    const selfLoops = new Set();
+    for (const { source_id: src, target_id: tgt } of edgeRows) {
+        if (!nodeSet.has(src) || !nodeSet.has(tgt))
+            continue;
+        if (src === tgt) {
+            selfLoops.add(src);
+            continue;
+        }
+        adj.get(src).push(tgt);
+        radj.get(tgt).push(src);
+    }
+    // Kosaraju's algorithm — pass 1: DFS on original graph, build finish order
+    const visited = new Set();
+    const finishOrder = [];
+    function dfs1(node) {
+        visited.add(node);
+        for (const neighbor of adj.get(node) ?? []) {
+            if (!visited.has(neighbor))
+                dfs1(neighbor);
+        }
+        finishOrder.push(node);
+    }
+    for (const node of nodes) {
+        if (!visited.has(node))
+            dfs1(node);
+    }
+    // Kosaraju's algorithm — pass 2: DFS on reverse graph in reverse finish order
+    const assigned = new Set();
+    const sccs = [];
+    function dfs2(node, component) {
+        assigned.add(node);
+        component.push(node);
+        for (const neighbor of radj.get(node) ?? []) {
+            if (!assigned.has(neighbor))
+                dfs2(neighbor, component);
+        }
+    }
+    for (let i = finishOrder.length - 1; i >= 0; i--) {
+        const node = finishOrder[i];
+        if (!assigned.has(node)) {
+            const component = [];
+            dfs2(node, component);
+            if (component.length > 1) {
+                sccs.push(component);
+            }
+        }
+    }
+    // Add self-loops as single-element cycles
+    for (const node of selfLoops) {
+        sccs.push([node]);
+    }
+    return sccs;
+}
+//# sourceMappingURL=cycles.js.map

package/dist/src/graph/cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycles.js","sourceRoot":"","sources":["../../../src/graph/cycles.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AACH,MAAM,UAAU,+BAA+B,CAAC,EAAe;IAC7D,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAsB,CAAC;IAC9E,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAGtE,CAAC;IAEJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACrD,IAAI,GAAG,KAAK,GAAG;YAAE,SAAS;QAC1B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,SAAS,IAAI,CAAC,IAAY;QACxB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,IAAI,CAAC,IAAY,EAAE,SAAmB;QAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CAAC,EAAe;IACxC,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAsB,CAAC;IAC9E,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAGtE,CAAC;IAEJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,kDAAkD;IAClD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,KAAK,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACrD,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;YAChB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,SAAS,IAAI,CAAC,IAAY;QACxB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,8EAA8E;IAC9E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,IAAI,CAAC,IAAY,EAAE,SAAmB;QAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACtB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/src/graph/dead-code.d.ts

@@ -0,0 +1,13 @@
+import type { MonographDb } from '../storage/db.js';
+/**
+ * Detect dead code: nodes that have in-degree 0 AND are not marked as exported.
+ *
+ * In a module dependency graph, a node with in-degree 0 is never imported by
+ * any other module. If it is also not explicitly exported (i.e., not an entry-point),
+ * it is considered dead code — unreachable and unused.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of node ids that are considered dead code.
+ */
+export declare function detectDeadCode(db: MonographDb): string[];
+//# sourceMappingURL=dead-code.d.ts.map

package/dist/src/graph/dead-code.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-code.d.ts","sourceRoot":"","sources":["../../../src/graph/dead-code.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,EAAE,CAgCxD"}

package/dist/src/graph/dead-code.js

@@ -0,0 +1,34 @@
+/**
+ * Detect dead code: nodes that have in-degree 0 AND are not marked as exported.
+ *
+ * In a module dependency graph, a node with in-degree 0 is never imported by
+ * any other module. If it is also not explicitly exported (i.e., not an entry-point),
+ * it is considered dead code — unreachable and unused.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of node ids that are considered dead code.
+ */
+export function detectDeadCode(db) {
+    const nodeRows = db.prepare('SELECT id, is_exported FROM nodes').all();
+    if (nodeRows.length === 0)
+        return [];
+    // Count in-degrees
+    const inDegree = new Map();
+    for (const { id } of nodeRows) {
+        inDegree.set(id, 0);
+    }
+    const edgeRows = db.prepare('SELECT target_id FROM edges WHERE source_id != target_id').all();
+    for (const { target_id } of edgeRows) {
+        if (inDegree.has(target_id)) {
+            inDegree.set(target_id, (inDegree.get(target_id) ?? 0) + 1);
+        }
+    }
+    const dead = [];
+    for (const { id, is_exported } of nodeRows) {
+        if ((inDegree.get(id) ?? 0) === 0 && is_exported !== 1) {
+            dead.push(id);
+        }
+    }
+    return dead;
+}
+//# sourceMappingURL=dead-code.js.map

package/dist/src/graph/dead-code.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-code.js","sourceRoot":"","sources":["../../../src/graph/dead-code.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAC,EAAe;IAC5C,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,EAGjE,CAAC;IAEJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,mBAAmB;IACnB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC9B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,0DAA0D,CAAC,CAAC,GAAG,EAExF,CAAC;IAEJ,KAAK,MAAM,EAAE,SAAS,EAAE,IAAI,QAAQ,EAAE,CAAC;QACrC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACvD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/src/graph/dependency-closure.d.ts

@@ -0,0 +1,18 @@
+import type { MonographDb } from '../storage/db.js';
+export interface DepClosureResult {
+    nodeId: string;
+    name: string;
+    filePath: string | null;
+    directDeps: string[];
+    transitiveDeps: string[];
+    depDepth: number;
+    unusedTransitiveDeps: string[];
+}
+export interface DepClosureReport {
+    nodes: DepClosureResult[];
+    avgDepDepth: number;
+    maxDepDepth: number;
+    deepDependencyFiles: DepClosureResult[];
+}
+export declare function computeDependencyClosure(db: MonographDb, maxNodes?: number): DepClosureReport;
+//# sourceMappingURL=dependency-closure.d.ts.map

package/dist/src/graph/dependency-closure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-closure.d.ts","sourceRoot":"","sources":["../../../src/graph/dependency-closure.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,oBAAoB,EAAE,MAAM,EAAE,CAAC;CAChC;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,gBAAgB,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE,gBAAgB,EAAE,CAAC;CACzC;AAED,wBAAgB,wBAAwB,CAAC,EAAE,EAAE,WAAW,EAAE,QAAQ,SAAM,GAAG,gBAAgB,CAyF1F"}

package/dist/src/graph/dependency-closure.js

@@ -0,0 +1,79 @@
+export function computeDependencyClosure(db, maxNodes = 100) {
+    // Get File nodes sorted by degree (most connected first)
+    const fileNodes = db.prepare(`
+    SELECT n.id, n.name, n.file_path,
+      (SELECT COUNT(*) FROM edges e WHERE e.source_id = n.id OR e.target_id = n.id) AS degree
+    FROM nodes n
+    WHERE n.label = 'File'
+    ORDER BY degree DESC
+    LIMIT ?
+  `).all(maxNodes);
+    // Build a set of all file_paths that have any IMPORTS edge pointing to them (are imported by someone)
+    const importedFilePaths = new Set(db.prepare(`
+      SELECT DISTINCT n.file_path
+      FROM edges e
+      JOIN nodes n ON n.id = e.target_id
+      WHERE e.relation = 'IMPORTS' AND n.file_path IS NOT NULL
+    `).all().map(r => r.file_path));
+    const results = [];
+    for (const fileNode of fileNodes) {
+        // BFS forward (following IMPORTS edges from this node)
+        const directDeps = [];
+        const transitiveDeps = [];
+        const visited = new Set([fileNode.id]);
+        let frontier = [fileNode.id];
+        let depth = 0;
+        let maxDepth = 0;
+        while (frontier.length > 0) {
+            depth++;
+            const next = [];
+            for (const id of frontier) {
+                const edges = db.prepare(`SELECT target_id FROM edges WHERE source_id = ? AND relation = 'IMPORTS'`).all(id);
+                for (const e of edges) {
+                    if (!visited.has(e.target_id)) {
+                        visited.add(e.target_id);
+                        next.push(e.target_id);
+                        if (depth === 1) {
+                            directDeps.push(e.target_id);
+                        }
+                        else {
+                            transitiveDeps.push(e.target_id);
+                        }
+                        maxDepth = depth;
+                    }
+                }
+            }
+            frontier = next;
+        }
+        // unusedTransitiveDeps: transitive deps whose file_path is NOT in importedFilePaths
+        const unusedTransitiveDeps = transitiveDeps.filter(depId => {
+            const depNode = db.prepare('SELECT file_path FROM nodes WHERE id = ?').get(depId);
+            if (!depNode?.file_path)
+                return false;
+            return !importedFilePaths.has(depNode.file_path);
+        });
+        results.push({
+            nodeId: fileNode.id,
+            name: fileNode.name,
+            filePath: fileNode.file_path,
+            directDeps,
+            transitiveDeps,
+            depDepth: maxDepth,
+            unusedTransitiveDeps,
+        });
+    }
+    // Sort by depDepth descending
+    results.sort((a, b) => b.depDepth - a.depDepth);
+    const avgDepDepth = results.length > 0
+        ? results.reduce((sum, r) => sum + r.depDepth, 0) / results.length
+        : 0;
+    const maxDepDepth = results.length > 0 ? results[0].depDepth : 0;
+    const deepDependencyFiles = results.filter(r => r.depDepth > 5);
+    return {
+        nodes: results,
+        avgDepDepth: Math.round(avgDepDepth * 100) / 100,
+        maxDepDepth,
+        deepDependencyFiles,
+    };
+}
+//# sourceMappingURL=dependency-closure.js.map

package/dist/src/graph/dependency-closure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-closure.js","sourceRoot":"","sources":["../../../src/graph/dependency-closure.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,wBAAwB,CAAC,EAAe,EAAE,QAAQ,GAAG,GAAG;IACtE,yDAAyD;IACzD,MAAM,SAAS,GAAI,EAAE,CAAC,OAAO,CAAC;;;;;;;GAO7B,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAmF,CAAC;IAEnG,sGAAsG;IACtG,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAC9B,EAAE,CAAC,OAAO,CAAC;;;;;KAKX,CAAC,CAAC,GAAG,EAAmC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAChE,CAAC;IAEF,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,uDAAuD;QACvD,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,EAAE,CAAC;YACR,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CACtB,0EAA0E,CAC3E,CAAC,GAAG,CAAC,EAAE,CAAiC,CAAC;gBAE1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBACvB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;4BAChB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBAC/B,CAAC;6BAAM,CAAC;4BACN,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBACnC,CAAC;wBACD,QAAQ,GAAG,KAAK,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,oFAAoF;QACpF,MAAM,oBAAoB,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YACzD,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,KAAK,CAA6C,CAAC;YAC9H,IAAI,CAAC,OAAO,EAAE,SAAS;gBAAE,OAAO,KAAK,CAAC;YACtC,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,QAAQ,CAAC,EAAE;YACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,QAAQ,EAAE,QAAQ,CAAC,SAAS;YAC5B,UAAU;YACV,cAAc;YACd,QAAQ,EAAE,QAAQ;YAClB,oBAAoB;SACrB,CAAC,CAAC;IACL,CAAC;IAED,8BAA8B;IAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEhD,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;QACpC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;QAClE,CAAC,CAAC,CAAC,CAAC;IACN,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,mBAAmB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAEhE,OAAO;QACL,KAAK,EAAE,OAAO;QACd,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG,GAAG;QAChD,WAAW;QACX,mBAAmB;KACpB,CAAC;AACJ,CAAC"}

package/dist/src/graph/dfs.d.ts

@@ -0,0 +1,9 @@
+export interface DfsNode {
+    id: string;
+    depth: number;
+}
+export interface DfsOptions {
+    maxDepth?: number;
+}
+export declare function dfsTraversal(startId: string, adjacency: Map<string, string[]>, visitor: (node: DfsNode) => void, options?: DfsOptions): void;
+//# sourceMappingURL=dfs.d.ts.map

package/dist/src/graph/dfs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.d.ts","sourceRoot":"","sources":["../../../src/graph/dfs.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAChC,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,IAAI,EAChC,OAAO,GAAE,UAAe,GACvB,IAAI,CAyBN"}

package/dist/src/graph/dfs.js

@@ -0,0 +1,25 @@
+export function dfsTraversal(startId, adjacency, visitor, options = {}) {
+    if (!adjacency.has(startId))
+        return;
+    const { maxDepth = Infinity } = options;
+    const visited = new Set();
+    const stack = [{ id: startId, depth: 0 }];
+    while (stack.length > 0) {
+        const { id, depth } = stack.pop();
+        if (visited.has(id))
+            continue;
+        visited.add(id);
+        visitor({ id, depth });
+        if (depth < maxDepth) {
+            const neighbors = adjacency.get(id) ?? [];
+            // Push in reverse order so left-most neighbor is processed first (DFS left-to-right order)
+            for (let i = neighbors.length - 1; i >= 0; i--) {
+                const neighbor = neighbors[i];
+                if (!visited.has(neighbor)) {
+                    stack.push({ id: neighbor, depth: depth + 1 });
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=dfs.js.map

package/dist/src/graph/dfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.js","sourceRoot":"","sources":["../../../src/graph/dfs.ts"],"names":[],"mappings":"AASA,MAAM,UAAU,YAAY,CAC1B,OAAe,EACf,SAAgC,EAChC,OAAgC,EAChC,UAAsB,EAAE;IAExB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO;IAEpC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACnC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAEvB,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC1C,2FAA2F;YAC3F,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/src/graph/diff.d.ts

@@ -13,6 +13,8 @@ export interface GraphDiff {
         before: MonographNode;
         after: MonographNode;
     }>;
+    /** Human-readable summary, e.g. "3 new nodes, 5 new edges, 1 node removed". */
+    summary: string;
 }
 export declare function diffSnapshots(before: GraphSnapshot, after: GraphSnapshot): GraphDiff;
 export declare function snapshotFromDb(db: import('../storage/db.js').MonographDb): GraphSnapshot;

package/dist/src/graph/diff.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../../src/graph/diff.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEhE,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,YAAY,EAAE,aAAa,EAAE,CAAC;IAC9B,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,YAAY,EAAE,aAAa,EAAE,CAAC;IAC9B,aAAa,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,KAAK,EAAE,aAAa,CAAA;KAAE,CAAC,CAAC;CACvE;AAED,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAgBpF;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,OAAO,kBAAkB,EAAE,WAAW,GAAG,aAAa,CA8BxF"}
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../../src/graph/diff.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEhE,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,YAAY,EAAE,aAAa,EAAE,CAAC;IAC9B,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,YAAY,EAAE,aAAa,EAAE,CAAC;IAC9B,aAAa,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,KAAK,EAAE,aAAa,CAAA;KAAE,CAAC,CAAC;IACtE,+EAA+E;IAC/E,OAAO,EAAE,MAAM,CAAC;CACjB;AAkBD,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,GAAG,SAAS,CAyBpF;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,OAAO,kBAAkB,EAAE,WAAW,GAAG,aAAa,CA8BxF"}