@monoes/monograph 1.5.4 → 1.5.5

package/dist/src/__tests__/export/gexf.test.js

@@ -1,66 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { toGexf } from '../../export/gexf.js';
-function makeNode(id, label = 'Function', name = id) {
-    return { id, label: label, name, isExported: false };
-}
-function makeEdge(id, sourceId, targetId, relation = 'CALLS') {
-    return { id, sourceId, targetId, relation, confidence: 'EXTRACTED', confidenceScore: 1.0 };
-}
-describe('toGexf', () => {
-    it('returns a string', () => {
-        expect(typeof toGexf([], [])).toBe('string');
-    });
-    it('starts with XML declaration', () => {
-        const result = toGexf([], []);
-        expect(result).toMatch(/^<\?xml/);
-    });
-    it('contains gexf root element', () => {
-        const result = toGexf([], []);
-        expect(result).toContain('<gexf');
-        expect(result).toContain('</gexf>');
-    });
-    it('contains graph element', () => {
-        const result = toGexf([], []);
-        expect(result).toContain('<graph');
-        expect(result).toContain('</graph>');
-    });
-    it('includes nodes section', () => {
-        const nodes = [makeNode('a'), makeNode('b')];
-        const result = toGexf(nodes, []);
-        expect(result).toContain('<nodes>');
-        expect(result).toContain('</nodes>');
-        expect(result).toContain('"a"');
-        expect(result).toContain('"b"');
-    });
-    it('includes edges section', () => {
-        const nodes = [makeNode('a'), makeNode('b')];
-        const edges = [makeEdge('e1', 'a', 'b')];
-        const result = toGexf(nodes, edges);
-        expect(result).toContain('<edges>');
-        expect(result).toContain('</edges>');
-        expect(result).toContain('e1');
-    });
-    it('includes node label attribute', () => {
-        const nodes = [makeNode('fn1', 'Function', 'myFunc')];
-        const result = toGexf(nodes, []);
-        expect(result).toContain('myFunc');
-    });
-    it('includes edge source and target', () => {
-        const nodes = [makeNode('a'), makeNode('b')];
-        const edges = [makeEdge('e1', 'a', 'b')];
-        const result = toGexf(nodes, edges);
-        expect(result).toContain('source="a"');
-        expect(result).toContain('target="b"');
-    });
-    it('handles empty nodes and edges gracefully', () => {
-        const result = toGexf([], []);
-        expect(result).toBeTruthy();
-        expect(result).toContain('<nodes');
-        expect(result).toContain('<edges');
-    });
-    it('marks graph as directed', () => {
-        const result = toGexf([], []);
-        expect(result).toContain('directed');
-    });
-});
-//# sourceMappingURL=gexf.test.js.map

package/dist/src/__tests__/export/gexf.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"gexf.test.js","sourceRoot":"","sources":["../../../../src/__tests__/export/gexf.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAG9C,SAAS,QAAQ,CAAC,EAAU,EAAE,KAAK,GAAG,UAAU,EAAE,IAAI,GAAG,EAAE;IACzD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAA+B,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACjF,CAAC;AAED,SAAS,QAAQ,CAAC,EAAU,EAAE,QAAgB,EAAE,QAAgB,EAAE,QAAQ,GAAG,OAAO;IAClF,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC;AAC7F,CAAC;AAED,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,CAAC,OAAO,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,CAAC;QAC5B,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/export/graphml.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=graphml.test.d.ts.map

package/dist/src/__tests__/export/graphml.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphml.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/export/graphml.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/export/graphml.test.js

@@ -1,51 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { toGraphml } from '../../export/graphml.js';
-const nodeWithCommunity = {
-    id: 'n1', label: 'Function', name: 'doStuff',
-    normLabel: 'function', filePath: '/a.ts',
-    isExported: true, communityId: 42,
-};
-const nodeWithoutCommunity = {
-    id: 'n2', label: 'Class', name: 'Foo',
-    normLabel: 'class', filePath: '/b.ts',
-    isExported: false,
-};
-const edge = {
-    id: 'e1', sourceId: 'n1', targetId: 'n2',
-    relation: 'CALLS', confidence: 'EXTRACTED', confidenceScore: 1.0,
-};
-describe('toGraphml', () => {
-    it('includes community key declaration in header', () => {
-        const out = toGraphml([nodeWithCommunity], []);
-        expect(out).toContain('<key id="community"');
-        expect(out).toContain('attr.name="community"');
-        expect(out).toContain('attr.type="int"');
-    });
-    it('includes community data element for node with communityId', () => {
-        const out = toGraphml([nodeWithCommunity], []);
-        expect(out).toContain('<data key="community">42</data>');
-    });
-    it('omits community data element when communityId is absent', () => {
-        const out = toGraphml([nodeWithoutCommunity], []);
-        // Should not have a community data tag for this node
-        const nodeSection = out.split('<node id="n2">')[1]?.split('</node>')[0] ?? '';
-        expect(nodeSection).not.toContain('<data key="community">');
-    });
-    it('produces valid graphml with edges', () => {
-        const out = toGraphml([nodeWithCommunity, nodeWithoutCommunity], [edge]);
-        expect(out).toContain('<?xml version="1.0"');
-        expect(out).toContain('<graphml');
-        expect(out).toContain('<edge id="e1"');
-        expect(out).toContain('<data key="relation">CALLS</data>');
-    });
-    it('escapes XML special characters in names', () => {
-        const n = {
-            id: 'n3', label: 'Function', name: 'foo<bar>&baz',
-            normLabel: 'function', isExported: false,
-        };
-        const out = toGraphml([n], []);
-        expect(out).toContain('foo&lt;bar&gt;&amp;baz');
-        expect(out).not.toContain('foo<bar>');
-    });
-});
-//# sourceMappingURL=graphml.test.js.map

package/dist/src/__tests__/export/graphml.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphml.test.js","sourceRoot":"","sources":["../../../../src/__tests__/export/graphml.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGpD,MAAM,iBAAiB,GAAkB;IACvC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS;IAC5C,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO;IACxC,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE;CAClC,CAAC;AACF,MAAM,oBAAoB,GAAkB;IAC1C,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;IACrC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IACrC,UAAU,EAAE,KAAK;CAClB,CAAC;AACF,MAAM,IAAI,GAAkB;IAC1B,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI;IACxC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG;CACjE,CAAC;AAEF,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACzB,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,iCAAiC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,oBAAoB,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,qDAAqD;QACrD,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9E,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,mCAAmC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAkB;YACvB,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,cAAc;YACjD,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK;SACzC,CAAC;QACF,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/export/mermaid.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=mermaid.test.d.ts.map

package/dist/src/__tests__/export/mermaid.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mermaid.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/export/mermaid.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/export/mermaid.test.js

@@ -1,78 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { toMermaid } from '../../export/mermaid.js';
-const fn = {
-    id: 'fn_alpha', label: 'Function', name: 'alpha',
-    normLabel: 'function', filePath: '/src/a.ts',
-    isExported: true,
-};
-const cls = {
-    id: 'cls_beta', label: 'Class', name: 'Beta',
-    normLabel: 'class', filePath: '/src/b.ts',
-    isExported: false,
-};
-const edge = {
-    id: 'e1', sourceId: 'fn_alpha', targetId: 'cls_beta',
-    relation: 'CALLS', confidence: 'EXTRACTED', confidenceScore: 1.0,
-};
-describe('toMermaid', () => {
-    it('starts with "graph" declaration', () => {
-        const out = toMermaid([fn], []);
-        expect(out).toMatch(/^graph\s+(TD|LR|RL|BT)/);
-    });
-    it('includes all node ids', () => {
-        const out = toMermaid([fn, cls], [edge]);
-        expect(out).toContain('fn_alpha');
-        expect(out).toContain('cls_beta');
-    });
-    it('includes an edge arrow between connected nodes', () => {
-        const out = toMermaid([fn, cls], [edge]);
-        // Arrow may include a label: fn_alpha -->|CALLS| cls_beta
-        expect(out).toMatch(/fn_alpha\s*-->(\|[^|]+\|)?\s*cls_beta/);
-    });
-    it('includes edge label with relation', () => {
-        const out = toMermaid([fn, cls], [edge]);
-        expect(out).toContain('CALLS');
-    });
-    it('includes node type/label in the diagram', () => {
-        const out = toMermaid([fn], []);
-        expect(out).toContain('Function');
-    });
-    it('returns empty graph declaration for empty inputs', () => {
-        const out = toMermaid([], []);
-        expect(out).toMatch(/^graph\s+(TD|LR|RL|BT)/);
-        expect(out).not.toContain('-->');
-    });
-    it('caps nodes at 200 to avoid huge diagrams', () => {
-        const nodes = Array.from({ length: 300 }, (_, i) => ({
-            id: `n${i}`, label: 'Function', name: `fn${i}`,
-            normLabel: 'function', isExported: false,
-        }));
-        const out = toMermaid(nodes, []);
-        // Should only contain up to 200 node definitions
-        const matches = out.match(/\bn\d+\b/g) ?? [];
-        const uniqueIds = new Set(matches);
-        expect(uniqueIds.size).toBeLessThanOrEqual(200);
-    });
-    it('sanitizes special characters in node names', () => {
-        const n = {
-            id: 'n_special', label: 'Function', name: 'foo<bar>"baz"',
-            normLabel: 'function', isExported: false,
-        };
-        const out = toMermaid([n], []);
-        expect(out).not.toContain('<bar>');
-        expect(out).not.toContain('"baz"');
-    });
-    it('includes community groupings as subgraphs when nodes have communityId', () => {
-        const a = { ...fn, communityId: 1 };
-        const b = { ...cls, communityId: 2 };
-        const out = toMermaid([a, b], []);
-        expect(out).toContain('subgraph');
-    });
-    it('uses dashed arrows for non-EXTRACTED edges', () => {
-        const inferredEdge = { ...edge, id: 'e2', confidence: 'INFERRED' };
-        const out = toMermaid([fn, cls], [inferredEdge]);
-        // Dashed arrow syntax: -..-> or -.->
-        expect(out).toMatch(/fn_alpha\s*-\.+->(\|[^|]+\|)?\s*cls_beta/);
-    });
-});
-//# sourceMappingURL=mermaid.test.js.map

package/dist/src/__tests__/export/mermaid.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mermaid.test.js","sourceRoot":"","sources":["../../../../src/__tests__/export/mermaid.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGpD,MAAM,EAAE,GAAkB;IACxB,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO;IAChD,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW;IAC5C,UAAU,EAAE,IAAI;CACjB,CAAC;AACF,MAAM,GAAG,GAAkB;IACzB,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM;IAC5C,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW;IACzC,UAAU,EAAE,KAAK;CAClB,CAAC;AACF,MAAM,IAAI,GAAkB;IAC1B,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU;IACpD,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG;CACjE,CAAC;AAEF,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACzB,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,0DAA0D;QAC1D,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAoB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACpE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;YAC9C,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK;SACzC,CAAC,CAAC,CAAC;QACJ,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACjC,iDAAiD;QACjD,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAkB;YACvB,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,eAAe;YACzD,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK;SACzC,CAAC;QACF,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,CAAC,GAAkB,EAAE,GAAG,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QACnD,MAAM,CAAC,GAAkB,EAAE,GAAG,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QACpD,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,YAAY,GAAkB,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;QAClF,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QACjD,qCAAqC;QACrC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/graph/betweenness.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=betweenness.test.d.ts.map

package/dist/src/__tests__/graph/betweenness.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"betweenness.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/betweenness.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/betweenness.test.js

@@ -1,77 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { getBetweennessCentrality } from '../../graph/analyzer.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id, name = id) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-        .run(id, name, name.toLowerCase());
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-describe('getBetweennessCentrality', () => {
-    it('returns a map from node id to centrality score', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const result = getBetweennessCentrality(db);
-        expect(result).toBeInstanceOf(Map);
-        expect(result.has('a')).toBe(true);
-        expect(result.has('b')).toBe(true);
-        expect(result.has('c')).toBe(true);
-        db.close();
-    });
-    it('node on all shortest paths has highest centrality', () => {
-        // a -> b -> c: b is on all paths between a and c
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const result = getBetweennessCentrality(db);
-        // b should have higher betweenness than a and c (endpoints)
-        expect(result.get('b')).toBeGreaterThan(result.get('a'));
-        expect(result.get('b')).toBeGreaterThan(result.get('c'));
-        db.close();
-    });
-    it('returns zero for isolated nodes', () => {
-        const db = makeTempDb();
-        insertNode(db, 'isolated');
-        const result = getBetweennessCentrality(db);
-        expect(result.get('isolated')).toBe(0);
-        db.close();
-    });
-    it('returns empty map for empty graph', () => {
-        const db = makeTempDb();
-        const result = getBetweennessCentrality(db);
-        expect(result.size).toBe(0);
-        db.close();
-    });
-    it('all scores are non-negative numbers', () => {
-        const db = makeTempDb();
-        insertNode(db, 'x');
-        insertNode(db, 'y');
-        insertNode(db, 'z');
-        insertEdge(db, 'x', 'y');
-        insertEdge(db, 'y', 'z');
-        insertEdge(db, 'x', 'z');
-        const result = getBetweennessCentrality(db);
-        for (const [, score] of result) {
-            expect(typeof score).toBe('number');
-            expect(score).toBeGreaterThanOrEqual(0);
-        }
-        db.close();
-    });
-});
-//# sourceMappingURL=betweenness.test.js.map

package/dist/src/__tests__/graph/betweenness.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"betweenness.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/betweenness.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,wBAAwB,EAAE,MAAM,yBAAyB,CAAC;AAEnE,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAE5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAC3D,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,EAAU,EAAE,IAAI,GAAG,EAAE;IAC9D,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC;SACvG,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACjE,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,iDAAiD;QACjD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,CAAC,CAAC;QAC5C,4DAA4D;QAC5D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QAC3D,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAE3B,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,CAAC,CAAC;QAC5C,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=cycles.test.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"cycles.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/cycles.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/cycles.test.js

@@ -1,119 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { findCycles } from '../../graph/cycles.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-cycles-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-        .run(id, id, id.toLowerCase());
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-describe('findCycles', () => {
-    it('returns empty array for empty graph', () => {
-        const db = makeTempDb();
-        expect(findCycles(db)).toEqual([]);
-        db.close();
-    });
-    it('returns empty array for single node with no self-loop', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        expect(findCycles(db)).toEqual([]);
-        db.close();
-    });
-    it('returns empty array for a DAG (no cycles)', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const cycles = findCycles(db);
-        expect(cycles).toEqual([]);
-        db.close();
-    });
-    it('detects a simple 2-node cycle: a->b->a', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'a');
-        const cycles = findCycles(db);
-        expect(cycles.length).toBeGreaterThan(0);
-        db.close();
-    });
-    it('detects a 3-node cycle: a->b->c->a', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        insertEdge(db, 'c', 'a');
-        const cycles = findCycles(db);
-        expect(cycles.length).toBeGreaterThan(0);
-        db.close();
-    });
-    it('each cycle is an array of node ids forming the cycle', () => {
-        const db = makeTempDb();
-        insertNode(db, 'x');
-        insertNode(db, 'y');
-        insertEdge(db, 'x', 'y');
-        insertEdge(db, 'y', 'x');
-        const cycles = findCycles(db);
-        expect(cycles.length).toBeGreaterThan(0);
-        const cycle = cycles[0];
-        expect(Array.isArray(cycle)).toBe(true);
-        expect(cycle.length).toBeGreaterThan(0);
-        for (const id of cycle) {
-            expect(typeof id).toBe('string');
-        }
-        db.close();
-    });
-    it('does not detect cycles in a tree', () => {
-        const db = makeTempDb();
-        // a tree: a->b, a->c, b->d, b->e
-        ['a', 'b', 'c', 'd', 'e'].forEach(id => insertNode(db, id));
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'a', 'c');
-        insertEdge(db, 'b', 'd');
-        insertEdge(db, 'b', 'e');
-        expect(findCycles(db)).toEqual([]);
-        db.close();
-    });
-    it('detects self-loop as a cycle', () => {
-        const db = makeTempDb();
-        insertNode(db, 'loop');
-        // bypass FK by doing the insertion with FK off
-        db.pragma('foreign_keys = OFF');
-        db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES ('self', 'loop', 'loop', 'CALLS', 'EXTRACTED', 1.0)`).run();
-        db.pragma('foreign_keys = ON');
-        const cycles = findCycles(db);
-        expect(cycles.length).toBeGreaterThan(0);
-        db.close();
-    });
-    it('handles multiple disconnected cycles', () => {
-        const db = makeTempDb();
-        // cycle 1: a->b->a
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'a');
-        // cycle 2: c->d->c
-        insertNode(db, 'c');
-        insertNode(db, 'd');
-        insertEdge(db, 'c', 'd');
-        insertEdge(db, 'd', 'c');
-        const cycles = findCycles(db);
-        expect(cycles.length).toBeGreaterThanOrEqual(2);
-        db.close();
-    });
-});
-//# sourceMappingURL=cycles.test.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"cycles.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/cycles.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAE5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,wBAAwB,CAAC,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,EAAU;IACnD,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC;SACvG,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACjE,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3B,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;QACD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,iCAAiC;QACjC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5D,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACvB,+CAA+C;QAC/C,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QAChC,EAAE,CAAC,OAAO,CAAC,iJAAiJ,CAAC,CAAC,GAAG,EAAE,CAAC;QACpK,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,mBAAmB;QACnB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,mBAAmB;QACnB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAChD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=dead-code.test.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"dead-code.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/dead-code.test.ts"],"names":[],"mappings":""}

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

@@ -1,89 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { detectDeadCode } from '../../graph/dead-code.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-deadcode-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id, isExported = 0) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, ?)`)
-        .run(id, id, id.toLowerCase(), isExported);
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-describe('detectDeadCode', () => {
-    it('returns empty array for empty graph', () => {
-        const db = makeTempDb();
-        expect(detectDeadCode(db)).toEqual([]);
-        db.close();
-    });
-    it('detects a node with in-degree 0 that is not exported', () => {
-        const db = makeTempDb();
-        // orphan: no incoming edges, not exported
-        insertNode(db, 'orphan', 0);
-        insertNode(db, 'b');
-        insertEdge(db, 'b', 'orphan');
-        // orphan has in-degree 1 — not dead
-        // let's make a true orphan
-        insertNode(db, 'dead', 0);
-        // dead has no incoming edges
-        const result = detectDeadCode(db);
-        expect(result).toContain('dead');
-        db.close();
-    });
-    it('does NOT flag exported nodes as dead code', () => {
-        const db = makeTempDb();
-        // exported root with in-degree 0 — this is an entrypoint, not dead code
-        insertNode(db, 'entry', 1);
-        const result = detectDeadCode(db);
-        expect(result).not.toContain('entry');
-        db.close();
-    });
-    it('does NOT flag nodes that have incoming edges', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        // b has in-degree 1 — reachable from a
-        const result = detectDeadCode(db);
-        expect(result).not.toContain('b');
-        db.close();
-    });
-    it('flags node with in-degree 0 and not exported', () => {
-        const db = makeTempDb();
-        insertNode(db, 'unused', 0);
-        const result = detectDeadCode(db);
-        expect(result).toContain('unused');
-        db.close();
-    });
-    it('handles mix of dead and live nodes', () => {
-        const db = makeTempDb();
-        insertNode(db, 'live_exported', 1); // exported — not dead
-        insertNode(db, 'live_used'); // has incoming
-        insertNode(db, 'dead1'); // orphan, not exported
-        insertNode(db, 'dead2'); // orphan, not exported
-        insertEdge(db, 'live_exported', 'live_used');
-        const result = detectDeadCode(db);
-        expect(result).toContain('dead1');
-        expect(result).toContain('dead2');
-        expect(result).not.toContain('live_exported');
-        expect(result).not.toContain('live_used');
-        db.close();
-    });
-    it('returns array of node id strings', () => {
-        const db = makeTempDb();
-        insertNode(db, 'unused');
-        const result = detectDeadCode(db);
-        expect(Array.isArray(result)).toBe(true);
-        for (const id of result) {
-            expect(typeof id).toBe('string');
-        }
-        db.close();
-    });
-});
-//# sourceMappingURL=dead-code.test.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"dead-code.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/dead-code.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAE5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,0BAA0B,CAAC,CAAC,CAAC;IACpE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,EAAU,EAAE,UAAU,GAAG,CAAC;IACnE,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC;SACvG,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,EAAE,UAAU,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACjE,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACvC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,0CAA0C;QAC1C,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5B,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC9B,oCAAoC;QACpC,2BAA2B;QAC3B,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1B,6BAA6B;QAC7B,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACjC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,wEAAwE;QACxE,UAAU,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACtC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,uCAAuC;QACvC,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAClC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,CAAE,sBAAsB;QAC3D,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAU,eAAe;QACrD,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAa,uBAAuB;QAC5D,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAa,uBAAuB;QAC5D,UAAU,CAAC,EAAE,EAAE,eAAe,EAAE,WAAW,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC1C,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;QACD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=dfs.test.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"dfs.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/dfs.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/dfs.test.js

@@ -1,56 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { dfsTraversal } from '../../graph/dfs.js';
-function makeGraph() {
-    const adj = new Map();
-    adj.set('a', ['b', 'c']);
-    adj.set('b', ['d']);
-    adj.set('c', ['d', 'e']);
-    adj.set('d', []);
-    adj.set('e', []);
-    return adj;
-}
-describe('dfsTraversal', () => {
-    it('visits all reachable nodes', () => {
-        const visited = [];
-        dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); });
-        expect(visited.sort()).toEqual(['a', 'b', 'c', 'd', 'e'].sort());
-    });
-    it('respects depth limit', () => {
-        const visited = [];
-        dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); }, { maxDepth: 1 });
-        expect(visited).toContain('a');
-        expect(visited).toContain('b');
-        expect(visited).toContain('c');
-        expect(visited).not.toContain('d');
-        expect(visited).not.toContain('e');
-    });
-    it('provides depth info in visitor', () => {
-        const depths = {};
-        dfsTraversal('a', makeGraph(), (node) => { depths[node.id] = node.depth; });
-        expect(depths['a']).toBe(0);
-        expect(depths['b']).toBe(1);
-        expect(depths['d']).toBe(2);
-    });
-    it('does not revisit nodes (cycle safety)', () => {
-        const cyclic = new Map();
-        cyclic.set('a', ['b']);
-        cyclic.set('b', ['c']);
-        cyclic.set('c', ['a']); // cycle
-        const visited = [];
-        dfsTraversal('a', cyclic, (node) => { visited.push(node.id); });
-        expect(visited.length).toBe(3);
-        expect(new Set(visited).size).toBe(3);
-    });
-    it('returns empty when start node not in graph', () => {
-        const visited = [];
-        dfsTraversal('z', makeGraph(), (node) => { visited.push(node.id); });
-        expect(visited).toEqual([]);
-    });
-    it('returns nodes in DFS pre-order', () => {
-        const visited = [];
-        dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); });
-        expect(visited.indexOf('a')).toBeLessThan(visited.indexOf('b'));
-        expect(visited.indexOf('b')).toBeLessThan(visited.indexOf('d'));
-    });
-});
-//# sourceMappingURL=dfs.test.js.map