mincut-context 1.0.0

package/dist/adapters/mcp/handler.d.ts

@@ -0,0 +1,112 @@
+/**
+ * MCP tool handler — pure functions, no JSON-RPC transport.
+ * The stdio server in index.ts is a thin wrapper around this.
+ *
+ * Tools exposed:
+ *   - pack_context(task, repo, budget?, seeds?, include?, exclude?)
+ *       → packs minimal context and returns JSON of files/ranges/explain
+ *   - explain_selection()
+ *       → returns the rationale for the most recent pack call
+ *   - expand_node(node, depth?)
+ *       → returns the graph neighborhood of a symbol id
+ *   - list_tools()  (used in tests / for introspection)
+ */
+export interface McpCall {
+    name: string;
+    arguments: Record<string, unknown>;
+}
+export interface McpResponse {
+    content: Array<{
+        type: 'text';
+        text: string;
+    }>;
+    isError?: boolean;
+}
+export declare const TOOLS: ({
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            task: {
+                type: string;
+                description: string;
+            };
+            repo: {
+                type: string;
+                description: string;
+            };
+            budget: {
+                type: string;
+                description: string;
+                default: number;
+            };
+            seeds: {
+                type: string;
+                description: string;
+                default: number;
+            };
+            include: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            exclude: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            node?: undefined;
+            depth?: undefined;
+        };
+        required: string[];
+    };
+} | {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            task?: undefined;
+            repo?: undefined;
+            budget?: undefined;
+            seeds?: undefined;
+            include?: undefined;
+            exclude?: undefined;
+            node?: undefined;
+            depth?: undefined;
+        };
+        required?: undefined;
+    };
+} | {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            node: {
+                type: string;
+                description: string;
+            };
+            depth: {
+                type: string;
+                default: number;
+            };
+            task?: undefined;
+            repo?: undefined;
+            budget?: undefined;
+            seeds?: undefined;
+            include?: undefined;
+            exclude?: undefined;
+        };
+        required: string[];
+    };
+})[];
+export declare function handleMcpCall(call: McpCall): Promise<McpResponse>;
+/** For tests — clear the session cache between cases. */
+export declare function _resetSession(): void;
+//# sourceMappingURL=handler.d.ts.map

package/dist/adapters/mcp/handler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"handler.d.ts","sourceRoot":"","sources":["../../../src/adapters/mcp/handler.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/C,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAUD,eAAO,MAAM,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IA+CjB,CAAC;AAEF,wBAAsB,aAAa,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,CAyBvE;AAoDD,yDAAyD;AACzD,wBAAgB,aAAa,IAAI,IAAI,CAIpC"}

package/dist/adapters/mcp/handler.js

@@ -0,0 +1,128 @@
+import { pack } from '../../select/pack.js';
+import { indexRepo } from '../../index/builder.js';
+const session = {};
+export const TOOLS = [
+    {
+        name: 'pack_context',
+        description: 'Pack a token-minimal, structurally-relevant context window for the given coding task. ' +
+            'Builds a symbol graph of the repo, runs personalized PageRank from task-derived seeds, ' +
+            'and selects the minimum-cut subgraph that fits the token budget.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                task: { type: 'string', description: 'Natural-language task description.' },
+                repo: { type: 'string', description: 'Absolute path to the repo root.' },
+                budget: { type: 'number', description: 'Token budget. Default 4000.', default: 4000 },
+                seeds: { type: 'number', description: 'Top-k seed symbols. Default 8.', default: 8 },
+                include: {
+                    type: 'array',
+                    items: { type: 'string' },
+                    description: "Glob-prefix includes, e.g. ['src/auth/**'].",
+                },
+                exclude: {
+                    type: 'array',
+                    items: { type: 'string' },
+                    description: 'Extra ignore patterns appended to .gitignore.',
+                },
+            },
+            required: ['task', 'repo'],
+        },
+    },
+    {
+        name: 'explain_selection',
+        description: 'Return the rationale string for the most recent pack_context call.',
+        inputSchema: { type: 'object', properties: {} },
+    },
+    {
+        name: 'expand_node',
+        description: 'Return the graph neighborhood (in+out neighbors) of a symbol id from the most ' +
+            'recent pack_context call.  Useful when the agent decides it needs more around a node.',
+        inputSchema: {
+            type: 'object',
+            properties: {
+                node: { type: 'string', description: 'Symbol id, e.g. "src/auth/login.ts:login".' },
+                depth: { type: 'number', default: 1 },
+            },
+            required: ['node'],
+        },
+    },
+];
+export async function handleMcpCall(call) {
+    try {
+        switch (call.name) {
+            case 'list_tools':
+                return ok({ tools: TOOLS });
+            case 'pack_context':
+                return await handlePack(call.arguments);
+            case 'explain_selection':
+                if (!session.lastResult)
+                    return error('no prior pack_context call in this session');
+                return ok({
+                    explain: session.lastResult.explain,
+                    files: session.lastResult.files.map((f) => f.path),
+                });
+            case 'expand_node':
+                return handleExpand(call.arguments);
+            default:
+                return error(`unknown tool: ${call.name}`);
+        }
+    }
+    catch (e) {
+        return error(e.message);
+    }
+}
+async function handlePack(args) {
+    const task = stringArg(args, 'task');
+    const repo = stringArg(args, 'repo');
+    if (!task || !repo)
+        return error('task and repo are required');
+    const budget = args.budget ?? 4000;
+    const seeds = args.seeds ?? 8;
+    const include = args.include;
+    const exclude = args.exclude;
+    const result = await pack({ task, repo, budget, seeds, include, exclude });
+    session.lastResult = result;
+    session.lastRepo = repo;
+    // Re-index so expand_node can use a fresh graph.
+    session.lastGraph = indexRepo(repo, { include, exclude }).graph;
+    return ok(result);
+}
+function handleExpand(args) {
+    if (!session.lastGraph)
+        return error('call pack_context first');
+    const node = stringArg(args, 'node');
+    if (!node)
+        return error('node is required');
+    const graph = session.lastGraph;
+    if (!graph.hasNode(node))
+        return error(`unknown node: ${node}`);
+    const data = graph.getNode(node);
+    const out = [...graph.outEdges(node)].map((e) => ({
+        target: e.target,
+        kind: e.data.kind,
+        weight: e.data.weight,
+    }));
+    const incoming = [...graph.inEdges(node)].map((e) => ({
+        source: e.target,
+        kind: e.data.kind,
+        weight: e.data.weight,
+    }));
+    return ok({ node, data, neighbors: [...out.map((o) => o.target), ...incoming.map((i) => i.source)], out, incoming });
+}
+function stringArg(args, key) {
+    const v = args[key];
+    return typeof v === 'string' && v.length > 0 ? v : null;
+}
+function ok(payload) {
+    return { content: [{ type: 'text', text: JSON.stringify(payload, null, 2) }] };
+}
+function error(msg) {
+    return { content: [{ type: 'text', text: `error: ${msg}` }], isError: true };
+}
+/** For tests — clear the session cache between cases. */
+export function _resetSession() {
+    session.lastResult = undefined;
+    session.lastRepo = undefined;
+    session.lastGraph = undefined;
+}
+//# sourceMappingURL=handler.js.map

package/dist/adapters/mcp/handler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"handler.js","sourceRoot":"","sources":["../../../src/adapters/mcp/handler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAmB,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAiCnD,MAAM,OAAO,GAAiB,EAAE,CAAC;AAEjC,MAAM,CAAC,MAAM,KAAK,GAAG;IACnB;QACE,IAAI,EAAE,cAAc;QACpB,WAAW,EACT,wFAAwF;YACxF,yFAAyF;YACzF,kEAAkE;QACpE,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,oCAAoC,EAAE;gBAC3E,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iCAAiC,EAAE;gBACxE,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,6BAA6B,EAAE,OAAO,EAAE,IAAI,EAAE;gBACrF,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,gCAAgC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACpF,OAAO,EAAE;oBACP,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,WAAW,EAAE,6CAA6C;iBAC3D;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,WAAW,EAAE,+CAA+C;iBAC7D;aACF;YACD,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;SAC3B;KACF;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,WAAW,EAAE,oEAAoE;QACjF,WAAW,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE;KAChD;IACD;QACE,IAAI,EAAE,aAAa;QACnB,WAAW,EACT,gFAAgF;YAChF,uFAAuF;QACzF,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,4CAA4C,EAAE;gBACnF,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,EAAE;aACtC;YACD,QAAQ,EAAE,CAAC,MAAM,CAAC;SACnB;KACF;CACF,CAAC;AAEF,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAAa;IAC/C,IAAI,CAAC;QACH,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,YAAY;gBACf,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAE9B,KAAK,cAAc;gBACjB,OAAO,MAAM,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAE1C,KAAK,mBAAmB;gBACtB,IAAI,CAAC,OAAO,CAAC,UAAU;oBAAE,OAAO,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBACpF,OAAO,EAAE,CAAC;oBACR,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,OAAO;oBACnC,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;iBACnD,CAAC,CAAC;YAEL,KAAK,aAAa;gBAChB,OAAO,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEtC;gBACE,OAAO,KAAK,CAAC,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAE,CAAW,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;AACH,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,IAA6B;IACrD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAI,IAAI,CAAC,MAAiB,IAAI,IAAI,CAAC;IAC/C,MAAM,KAAK,GAAI,IAAI,CAAC,KAAgB,IAAI,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,OAA+B,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,CAAC,OAA+B,CAAC;IAErD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IAC3E,OAAO,CAAC,UAAU,GAAG,MAAM,CAAC;IAC5B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IACxB,iDAAiD;IACjD,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC;IAChE,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;AACpB,CAAC;AAED,SAAS,YAAY,CAAC,IAA6B;IACjD,IAAI,CAAC,OAAO,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC;IAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChD,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;QACjB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM;KACtB,CAAC,CAAC,CAAC;IACJ,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;QACjB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM;KACtB,CAAC,CAAC,CAAC;IACJ,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;AACvH,CAAC;AAED,SAAS,SAAS,CAAC,IAA6B,EAAE,GAAW;IAC3D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC;AAED,SAAS,EAAE,CAAC,OAAgB;IAC1B,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACjF,CAAC;AAED,SAAS,KAAK,CAAC,GAAW;IACxB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC/E,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,aAAa;IAC3B,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC;IAC/B,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAC7B,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;AAChC,CAAC"}

package/dist/adapters/mcp/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Thin stdio JSON-RPC wrapper around the pure handler in ./handler.ts.
+ * All business logic lives in the handler — this file only does transport.
+ */
+export declare function runMcpServer(): Promise<void>;
+//# sourceMappingURL=index.d.ts.map

package/dist/adapters/mcp/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/adapters/mcp/index.ts"],"names":[],"mappings":"AAQA;;;GAGG;AACH,wBAAsB,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,CA6BlD"}

package/dist/adapters/mcp/index.js

@@ -0,0 +1,32 @@
+import { Server } from '@modelcontextprotocol/sdk/server/index.js';
+import { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';
+import { CallToolRequestSchema, ListToolsRequestSchema, } from '@modelcontextprotocol/sdk/types.js';
+import { handleMcpCall, TOOLS } from './handler.js';
+/**
+ * Thin stdio JSON-RPC wrapper around the pure handler in ./handler.ts.
+ * All business logic lives in the handler — this file only does transport.
+ */
+export async function runMcpServer() {
+    const server = new Server({ name: 'mincut-context', version: '1.0.0' }, { capabilities: { tools: {} } });
+    server.setRequestHandler(ListToolsRequestSchema, async () => ({
+        tools: TOOLS.map((t) => ({
+            name: t.name,
+            description: t.description,
+            inputSchema: t.inputSchema,
+        })),
+    }));
+    server.setRequestHandler(CallToolRequestSchema, async (request) => {
+        const result = await handleMcpCall({
+            name: request.params.name,
+            arguments: request.params.arguments ?? {},
+        });
+        // The MCP SDK's request handler return type includes a richer
+        // task-tracking shape we don't need here; runtime payload is identical.
+        return result;
+    });
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+    // Keep the process alive — the transport handles graceful shutdown on EOF.
+    process.stderr.write('mincut-context MCP server running on stdio\n');
+}
+//# sourceMappingURL=index.js.map

package/dist/adapters/mcp/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/adapters/mcp/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,2CAA2C,CAAC;AACnE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EACL,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAEpD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY;IAChC,MAAM,MAAM,GAAG,IAAI,MAAM,CACvB,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,OAAO,EAAE,EAC5C,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAChC,CAAC;IAEF,MAAM,CAAC,iBAAiB,CAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;QAC5D,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;SAC3B,CAAC,CAAC;KACJ,CAAC,CAAC,CAAC;IAEJ,MAAM,CAAC,iBAAiB,CAAC,qBAAqB,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;QAChE,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC;YACjC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI;YACzB,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE;SAC1C,CAAC,CAAC;QACH,8DAA8D;QAC9D,wEAAwE;QACxE,OAAO,MAA0F,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAEhC,2EAA2E;IAC3E,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;AACvE,CAAC"}

package/dist/core/graph.d.ts

@@ -0,0 +1,50 @@
+export type NodeKind = 'function' | 'method' | 'class' | 'interface' | 'type' | 'variable' | 'export' | 'file';
+export type EdgeKind = 'call' | 'import' | 'reference' | 'extends' | 'implements' | 'contains';
+export interface NodeData {
+    tokens: number;
+    file: string;
+    kind: NodeKind;
+    name?: string;
+    startLine?: number;
+    endLine?: number;
+}
+export interface EdgeData {
+    weight: number;
+    kind: EdgeKind;
+}
+export interface OutEdge {
+    target: string;
+    data: EdgeData;
+}
+export declare class SymbolGraph {
+    private readonly nodeData;
+    private readonly outAdj;
+    private readonly inAdj;
+    private edgeCount;
+    addNode(id: string, data: NodeData): void;
+    hasNode(id: string): boolean;
+    getNode(id: string): NodeData | undefined;
+    nodes(): string[];
+    order(): number;
+    size(): number;
+    addEdge(source: string, target: string, data: EdgeData): void;
+    hasEdge(source: string, target: string): boolean;
+    getEdge(source: string, target: string): EdgeData | undefined;
+    outNeighbors(id: string): string[];
+    inNeighbors(id: string): string[];
+    neighbors(id: string): string[];
+    outEdges(id: string): IterableIterator<OutEdge>;
+    inEdges(id: string): IterableIterator<OutEdge>;
+    /**
+     * Boundary cut cost: sum of edge weights crossing T → V\T (directed).
+     *
+     * This is the objective we minimize in the budget-constrained selection.
+     * Lower = the selected region T is more self-contained.
+     */
+    cutCost(t: ReadonlySet<string>): number;
+    /**
+     * Sum of token costs over a node set.  Used by the budget-constrained selector.
+     */
+    tokensOf(t: Iterable<string>): number;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/core/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/core/graph.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,QAAQ,GAChB,UAAU,GACV,QAAQ,GACR,OAAO,GACP,WAAW,GACX,MAAM,GACN,UAAU,GACV,QAAQ,GACR,MAAM,CAAC;AAEX,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,GAAG,SAAS,GAAG,YAAY,GAAG,UAAU,CAAC;AAE/F,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,CAAC;CAChB;AAED,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,CAAC;CAChB;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA+B;IACxD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA4C;IACnE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA4C;IAClE,OAAO,CAAC,SAAS,CAAK;IAEtB,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI;IASzC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAIzC,KAAK,IAAI,MAAM,EAAE;IAIjB,KAAK,IAAI,MAAM;IAIf,IAAI,IAAI,MAAM;IAId,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI;IAe7D,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAIhD,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAI7D,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAIlC,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAIjC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAM9B,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC;IAQ/C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC;IAQ/C;;;;;OAKG;IACH,OAAO,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM;IAavC;;OAEG;IACH,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,MAAM;CAOtC"}

package/dist/core/graph.js

@@ -0,0 +1,110 @@
+export class SymbolGraph {
+    nodeData = new Map();
+    outAdj = new Map();
+    inAdj = new Map();
+    edgeCount = 0;
+    addNode(id, data) {
+        if (this.nodeData.has(id)) {
+            throw new Error(`duplicate node: ${id}`);
+        }
+        this.nodeData.set(id, data);
+        this.outAdj.set(id, new Map());
+        this.inAdj.set(id, new Map());
+    }
+    hasNode(id) {
+        return this.nodeData.has(id);
+    }
+    getNode(id) {
+        return this.nodeData.get(id);
+    }
+    nodes() {
+        return [...this.nodeData.keys()];
+    }
+    order() {
+        return this.nodeData.size;
+    }
+    size() {
+        return this.edgeCount;
+    }
+    addEdge(source, target, data) {
+        if (!this.nodeData.has(source))
+            throw new Error(`missing source node: ${source}`);
+        if (!this.nodeData.has(target))
+            throw new Error(`missing target node: ${target}`);
+        const out = this.outAdj.get(source);
+        const existing = out.get(target);
+        if (existing) {
+            existing.weight += data.weight;
+            return;
+        }
+        out.set(target, { ...data });
+        this.inAdj.get(target).set(source, out.get(target));
+        this.edgeCount += 1;
+    }
+    hasEdge(source, target) {
+        return this.outAdj.get(source)?.has(target) ?? false;
+    }
+    getEdge(source, target) {
+        return this.outAdj.get(source)?.get(target);
+    }
+    outNeighbors(id) {
+        return [...(this.outAdj.get(id)?.keys() ?? [])];
+    }
+    inNeighbors(id) {
+        return [...(this.inAdj.get(id)?.keys() ?? [])];
+    }
+    neighbors(id) {
+        const set = new Set(this.outNeighbors(id));
+        for (const n of this.inNeighbors(id))
+            set.add(n);
+        return [...set];
+    }
+    *outEdges(id) {
+        const adj = this.outAdj.get(id);
+        if (!adj)
+            return;
+        for (const [target, data] of adj) {
+            yield { target, data };
+        }
+    }
+    *inEdges(id) {
+        const adj = this.inAdj.get(id);
+        if (!adj)
+            return;
+        for (const [source, data] of adj) {
+            yield { target: source, data };
+        }
+    }
+    /**
+     * Boundary cut cost: sum of edge weights crossing T → V\T (directed).
+     *
+     * This is the objective we minimize in the budget-constrained selection.
+     * Lower = the selected region T is more self-contained.
+     */
+    cutCost(t) {
+        if (t.size === 0 || t.size === this.nodeData.size)
+            return 0;
+        let cost = 0;
+        for (const source of t) {
+            const adj = this.outAdj.get(source);
+            if (!adj)
+                continue;
+            for (const [target, data] of adj) {
+                if (!t.has(target))
+                    cost += data.weight;
+            }
+        }
+        return cost;
+    }
+    /**
+     * Sum of token costs over a node set.  Used by the budget-constrained selector.
+     */
+    tokensOf(t) {
+        let sum = 0;
+        for (const id of t) {
+            sum += this.nodeData.get(id)?.tokens ?? 0;
+        }
+        return sum;
+    }
+}
+//# sourceMappingURL=graph.js.map

package/dist/core/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/core/graph.ts"],"names":[],"mappings":"AA+BA,MAAM,OAAO,WAAW;IACL,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvC,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;IAClD,KAAK,GAAG,IAAI,GAAG,EAAiC,CAAC;IAC1D,SAAS,GAAG,CAAC,CAAC;IAEtB,OAAO,CAAC,EAAU,EAAE,IAAc;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK;QACH,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,IAAc;QACpD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;QAElF,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,MAAc;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;IACvD,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,MAAc;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,YAAY,CAAC,EAAU;QACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,WAAW,CAAC,EAAU;QACpB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,SAAS,CAAC,EAAU;QAClB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,CAAC,QAAQ,CAAC,EAAU;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACjC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;IAED,CAAC,OAAO,CAAC,EAAU;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACjC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACjC,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,CAAsB;QAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,CAAmB;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;YACnB,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/core/index.d.ts

@@ -0,0 +1,7 @@
+export { SymbolGraph } from './graph.js';
+export type { NodeData, EdgeData, NodeKind, EdgeKind, OutEdge } from './graph.js';
+export { personalizedPageRank } from './pagerank.js';
+export type { PageRankOptions } from './pagerank.js';
+export { greedySelect } from './select.js';
+export type { SelectOptions, SelectionEntry, SelectionResult } from './select.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAClF,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AACrD,YAAY,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/core/index.js

@@ -0,0 +1,4 @@
+export { SymbolGraph } from './graph.js';
+export { personalizedPageRank } from './pagerank.js';
+export { greedySelect } from './select.js';
+//# sourceMappingURL=index.js.map

package/dist/core/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAErD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC"}

package/dist/core/pagerank.d.ts

@@ -0,0 +1,30 @@
+import type { SymbolGraph } from './graph.js';
+export interface PageRankOptions {
+    /**
+     * Personalization vector: node id → mass.  Values do not need to sum to 1;
+     * they will be normalized.  Must be non-empty.
+     */
+    seeds: ReadonlyMap<string, number>;
+    /** Damping factor.  Standard PageRank uses 0.85. */
+    alpha?: number;
+    /** Maximum power-iteration steps before forced halt. */
+    maxIterations?: number;
+    /** L1 convergence threshold across one iteration. */
+    tolerance?: number;
+}
+/**
+ * Personalized PageRank via power iteration.
+ *
+ *     r ← α · M · r  +  (1 − α) · p
+ *
+ * where M is the column-stochastic transition matrix derived from edge weights,
+ * p is the personalization vector, and dangling nodes redistribute their mass
+ * back through p (so the chain is ergodic and convergence is guaranteed).
+ *
+ * Why personalized?  The restart vector p is concentrated on the task's seed
+ * nodes — symbols matched by the user's query — so rank mass pools around the
+ * region of the graph that's structurally relevant to the task instead of
+ * spreading uniformly.  This is what makes the algorithm task-aware.
+ */
+export declare function personalizedPageRank(graph: SymbolGraph, options: PageRankOptions): Map<string, number>;
+//# sourceMappingURL=pagerank.d.ts.map

package/dist/core/pagerank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.d.ts","sourceRoot":"","sources":["../../src/core/pagerank.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEnC,oDAAoD;IACpD,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,wDAAwD;IACxD,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,qDAAqD;IACrD,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,eAAe,GACvB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA4ErB"}

package/dist/core/pagerank.js

@@ -0,0 +1,88 @@
+/**
+ * Personalized PageRank via power iteration.
+ *
+ *     r ← α · M · r  +  (1 − α) · p
+ *
+ * where M is the column-stochastic transition matrix derived from edge weights,
+ * p is the personalization vector, and dangling nodes redistribute their mass
+ * back through p (so the chain is ergodic and convergence is guaranteed).
+ *
+ * Why personalized?  The restart vector p is concentrated on the task's seed
+ * nodes — symbols matched by the user's query — so rank mass pools around the
+ * region of the graph that's structurally relevant to the task instead of
+ * spreading uniformly.  This is what makes the algorithm task-aware.
+ */
+export function personalizedPageRank(graph, options) {
+    const { seeds, alpha = 0.85, maxIterations = 100, tolerance = 1e-8 } = options;
+    if (seeds.size === 0) {
+        throw new Error('personalizedPageRank requires at least one seed');
+    }
+    for (const id of seeds.keys()) {
+        if (!graph.hasNode(id)) {
+            throw new Error(`seed node not in graph: ${id}`);
+        }
+    }
+    const nodes = graph.nodes();
+    const n = nodes.length;
+    if (n === 0)
+        return new Map();
+    // Build normalized personalization vector p.
+    let totalSeed = 0;
+    for (const w of seeds.values())
+        totalSeed += w;
+    if (totalSeed <= 0)
+        throw new Error('seed weights must sum to a positive number');
+    const p = new Map();
+    for (const [id, w] of seeds)
+        p.set(id, w / totalSeed);
+    // Precompute outgoing weight sums per node (for column normalization).
+    const outWeight = new Map();
+    for (const id of nodes) {
+        let sum = 0;
+        for (const e of graph.outEdges(id))
+            sum += e.data.weight;
+        outWeight.set(id, sum);
+    }
+    // Initialize r ← p extended over all nodes (0 for non-seeds).
+    let r = new Map();
+    for (const id of nodes)
+        r.set(id, p.get(id) ?? 0);
+    for (let iter = 0; iter < maxIterations; iter++) {
+        const next = new Map();
+        // 1. Sum mass coming from dangling nodes (no outgoing edges).
+        let danglingMass = 0;
+        for (const id of nodes) {
+            if ((outWeight.get(id) ?? 0) === 0) {
+                danglingMass += r.get(id) ?? 0;
+            }
+        }
+        // 2. Initialize next ← (1 − α) · p   plus dangling redistribution through p.
+        for (const id of nodes) {
+            const personalization = p.get(id) ?? 0;
+            next.set(id, (1 - alpha) * personalization + alpha * danglingMass * personalization);
+        }
+        // 3. Propagate α · M · r across outgoing edges.
+        for (const id of nodes) {
+            const out = outWeight.get(id) ?? 0;
+            if (out === 0)
+                continue;
+            const ri = r.get(id) ?? 0;
+            if (ri === 0)
+                continue;
+            for (const edge of graph.outEdges(id)) {
+                const share = alpha * ri * (edge.data.weight / out);
+                next.set(edge.target, (next.get(edge.target) ?? 0) + share);
+            }
+        }
+        // 4. Convergence check (L1 distance).
+        let delta = 0;
+        for (const id of nodes) {
+            delta += Math.abs((next.get(id) ?? 0) - (r.get(id) ?? 0));
+        }
+        r = next;
+        if (delta < tolerance)
+            break;
+    }
+    return r;
+}
+//# sourceMappingURL=pagerank.js.map

package/dist/core/pagerank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.js","sourceRoot":"","sources":["../../src/core/pagerank.ts"],"names":[],"mappings":"AAmBA;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAkB,EAClB,OAAwB;IAExB,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,EAAE,aAAa,GAAG,GAAG,EAAE,SAAS,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IAE/E,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;IACrE,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAE9B,6CAA6C;IAC7C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;QAAE,SAAS,IAAI,CAAC,CAAC;IAC/C,IAAI,SAAS,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAElF,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;IAEtD,uEAAuE;IACvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACzD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,KAAK;QAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAElD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEvC,8DAA8D;QAC9D,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnC,YAAY,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe,GAAG,KAAK,GAAG,YAAY,GAAG,eAAe,CAAC,CAAC;QACvF,CAAC;QAED,gDAAgD;QAChD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,GAAG,KAAK,CAAC;gBAAE,SAAS;YACxB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,EAAE,KAAK,CAAC;gBAAE,SAAS;YACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtC,MAAM,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;gBACpD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,CAAC,GAAG,IAAI,CAAC;QACT,IAAI,KAAK,GAAG,SAAS;YAAE,MAAM;IAC/B,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC"}