@optave/codegraph 3.2.0 → 3.3.1

package/dist/graph/builders/structure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"structure.js","sourceRoot":"","sources":["../../../src/graph/builders/structure.js"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAE;IACpC,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAE9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,qDAAqD,CAAC,CAAC,GAAG,EAAE,CAAC;IAErF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,sDAAsD,CAAC,CAAC,GAAG,EAAE,CAAC;IAEvF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,aAAa,GAAG,EAAE;SACrB,OAAO,CAAC;;;;;KAKR,CAAC;SACD,GAAG,EAAE,CAAC;IAET,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAChF,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graph/builders/temporal.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @param {object} db - Open better-sqlite3 database (readonly)
+ * @param {{ minJaccard?: number }} [opts]
+ * @returns {CodeGraph} Undirected graph weighted by Jaccard similarity
+ */
+export function buildTemporalGraph(db: object, opts?: {
+    minJaccard?: number;
+}): CodeGraph;
+import { CodeGraph } from '../model.js';
+//# sourceMappingURL=temporal.d.ts.map

package/dist/graph/builders/temporal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.d.ts","sourceRoot":"","sources":["../../../src/graph/builders/temporal.js"],"names":[],"mappings":"AAMA;;;;GAIG;AACH,uCAJW,MAAM,SACN;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GACrB,SAAS,CAuBrB;0BA5ByB,aAAa"}

package/dist/graph/builders/temporal.js

@@ -0,0 +1,31 @@
+/**
+ * Build a co-change (temporal) graph weighted by Jaccard similarity.
+ */
+import { CodeGraph } from '../model.js';
+/**
+ * @param {object} db - Open better-sqlite3 database (readonly)
+ * @param {{ minJaccard?: number }} [opts]
+ * @returns {CodeGraph} Undirected graph weighted by Jaccard similarity
+ */
+export function buildTemporalGraph(db, opts = {}) {
+    const minJaccard = opts.minJaccard ?? 0.0;
+    const graph = new CodeGraph({ directed: false });
+    // Check if co_changes table exists
+    const tableCheck = db
+        .prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='co_changes'")
+        .get();
+    if (!tableCheck)
+        return graph;
+    const rows = db
+        .prepare('SELECT file_a, file_b, jaccard FROM co_changes WHERE jaccard >= ?')
+        .all(minJaccard);
+    for (const r of rows) {
+        if (!graph.hasNode(r.file_a))
+            graph.addNode(r.file_a, { label: r.file_a });
+        if (!graph.hasNode(r.file_b))
+            graph.addNode(r.file_b, { label: r.file_b });
+        graph.addEdge(r.file_a, r.file_b, { jaccard: r.jaccard });
+    }
+    return graph;
+}
+//# sourceMappingURL=temporal.js.map

package/dist/graph/builders/temporal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.js","sourceRoot":"","sources":["../../../src/graph/builders/temporal.js"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE;IAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAEjD,mCAAmC;IACnC,MAAM,UAAU,GAAG,EAAE;SAClB,OAAO,CAAC,yEAAyE,CAAC;SAClF,GAAG,EAAE,CAAC;IACT,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAE9B,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,mEAAmE,CAAC;SAC5E,GAAG,CAAC,UAAU,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graph/classifiers/index.d.ts

@@ -0,0 +1,3 @@
+export { DEFAULT_WEIGHTS, minMaxNormalize, ROLE_WEIGHTS, scoreRisk } from "./risk.js";
+export { classifyRoles, FRAMEWORK_ENTRY_PREFIXES } from "./roles.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/classifiers/index.d.ts.map

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

package/dist/graph/classifiers/index.js

@@ -0,0 +1,3 @@
+export { DEFAULT_WEIGHTS, minMaxNormalize, ROLE_WEIGHTS, scoreRisk } from './risk.js';
+export { classifyRoles, FRAMEWORK_ENTRY_PREFIXES } from './roles.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/classifiers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/classifiers/index.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/classifiers/risk.d.ts

@@ -0,0 +1,49 @@
+/** Min-max normalize an array of numbers. All-equal → all zeros. */
+export function minMaxNormalize(values: any): any;
+/**
+ * Score risk for a list of items.
+ *
+ * @param {{ fan_in: number, cognitive: number, churn: number, mi: number, role: string|null }[]} items
+ * @param {object} [weights] - Override DEFAULT_WEIGHTS
+ * @param {{ roleWeights?: object, defaultRoleWeight?: number }} [opts] - Optional role weight overrides
+ * @returns {{ normFanIn: number, normComplexity: number, normChurn: number, normMI: number, roleWeight: number, riskScore: number }[]}
+ *   Parallel array with risk metrics for each input item.
+ */
+export function scoreRisk(items: {
+    fan_in: number;
+    cognitive: number;
+    churn: number;
+    mi: number;
+    role: string | null;
+}[], weights?: object, opts?: {
+    roleWeights?: object;
+    defaultRoleWeight?: number;
+}): {
+    normFanIn: number;
+    normComplexity: number;
+    normChurn: number;
+    normMI: number;
+    roleWeight: number;
+    riskScore: number;
+}[];
+export namespace DEFAULT_WEIGHTS {
+    let fanIn: number;
+    let complexity: number;
+    let churn: number;
+    let role: number;
+    let mi: number;
+}
+export const ROLE_WEIGHTS: {
+    core: number;
+    utility: number;
+    entry: number;
+    adapter: number;
+    leaf: number;
+    'test-only': number;
+    dead: number;
+    'dead-leaf': number;
+    'dead-entry': number;
+    'dead-ffi': number;
+    'dead-unresolved': number;
+};
+//# sourceMappingURL=risk.d.ts.map

package/dist/graph/classifiers/risk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"risk.d.ts","sourceRoot":"","sources":["../../../src/graph/classifiers/risk.js"],"names":[],"mappings":"AAoCA,oEAAoE;AACpE,kDAMC;AAMD;;;;;;;;GAQG;AACH,iCANW;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,GAAC,IAAI,CAAA;CAAE,EAAE,YACrF,MAAM,SACN;IAAE,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAAE,GAClD;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,EAAE,CAqCrI;;;;;;;;AAxED;;;;;;;;;;;;EAYE"}

package/dist/graph/classifiers/risk.js

@@ -0,0 +1,84 @@
+/**
+ * Risk scoring — pure logic, no DB.
+ */
+// Weights sum to 1.0. Complexity gets the highest weight because cognitive load
+// is the strongest predictor of defect density. Fan-in and churn are next as
+// they reflect coupling and volatility. Role adds architectural context, and MI
+// (maintainability index) is a weaker composite signal, so it gets the least.
+export const DEFAULT_WEIGHTS = {
+    fanIn: 0.25,
+    complexity: 0.3,
+    churn: 0.2,
+    role: 0.15,
+    mi: 0.1,
+};
+// Role weights reflect structural importance: core modules are central to the
+// dependency graph, utilities are widely imported, entry points are API
+// surfaces. Adapters bridge subsystems but are replaceable. Leaves, dead
+// code, and test-only symbols have minimal downstream impact.
+export const ROLE_WEIGHTS = {
+    core: 1.0,
+    utility: 0.9,
+    entry: 0.8,
+    adapter: 0.5,
+    leaf: 0.2,
+    'test-only': 0.1,
+    dead: 0.1,
+    'dead-leaf': 0.0,
+    'dead-entry': 0.3,
+    'dead-ffi': 0.05,
+    'dead-unresolved': 0.15,
+};
+const DEFAULT_ROLE_WEIGHT = 0.5;
+/** Min-max normalize an array of numbers. All-equal → all zeros. */
+export function minMaxNormalize(values) {
+    const min = Math.min(...values);
+    const max = Math.max(...values);
+    if (max === min)
+        return values.map(() => 0);
+    const range = max - min;
+    return values.map((v) => (v - min) / range);
+}
+function round4(n) {
+    return Math.round(n * 10000) / 10000;
+}
+/**
+ * Score risk for a list of items.
+ *
+ * @param {{ fan_in: number, cognitive: number, churn: number, mi: number, role: string|null }[]} items
+ * @param {object} [weights] - Override DEFAULT_WEIGHTS
+ * @param {{ roleWeights?: object, defaultRoleWeight?: number }} [opts] - Optional role weight overrides
+ * @returns {{ normFanIn: number, normComplexity: number, normChurn: number, normMI: number, roleWeight: number, riskScore: number }[]}
+ *   Parallel array with risk metrics for each input item.
+ */
+export function scoreRisk(items, weights = {}, opts = {}) {
+    const w = { ...DEFAULT_WEIGHTS, ...weights };
+    const rw = opts.roleWeights || ROLE_WEIGHTS;
+    const drw = opts.defaultRoleWeight ?? DEFAULT_ROLE_WEIGHT;
+    const fanIns = items.map((r) => r.fan_in);
+    const cognitives = items.map((r) => r.cognitive);
+    const churns = items.map((r) => r.churn);
+    const mis = items.map((r) => r.mi);
+    const normFanIns = minMaxNormalize(fanIns);
+    const normCognitives = minMaxNormalize(cognitives);
+    const normChurns = minMaxNormalize(churns);
+    const normMIsRaw = minMaxNormalize(mis);
+    const normMIs = normMIsRaw.map((v) => round4(1 - v));
+    return items.map((r, i) => {
+        const roleWeight = rw[r.role] ?? drw;
+        const riskScore = w.fanIn * normFanIns[i] +
+            w.complexity * normCognitives[i] +
+            w.churn * normChurns[i] +
+            w.role * roleWeight +
+            w.mi * normMIs[i];
+        return {
+            normFanIn: round4(normFanIns[i]),
+            normComplexity: round4(normCognitives[i]),
+            normChurn: round4(normChurns[i]),
+            normMI: round4(normMIs[i]),
+            roleWeight,
+            riskScore: round4(riskScore),
+        };
+    });
+}
+//# sourceMappingURL=risk.js.map

package/dist/graph/classifiers/risk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"risk.js","sourceRoot":"","sources":["../../../src/graph/classifiers/risk.js"],"names":[],"mappings":"AAAA;;GAEG;AAEH,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,KAAK,EAAE,IAAI;IACX,UAAU,EAAE,GAAG;IACf,KAAK,EAAE,GAAG;IACV,IAAI,EAAE,IAAI;IACV,EAAE,EAAE,GAAG;CACR,CAAC;AAEF,8EAA8E;AAC9E,wEAAwE;AACxE,yEAAyE;AACzE,8DAA8D;AAC9D,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,IAAI,EAAE,GAAG;IACT,OAAO,EAAE,GAAG;IACZ,KAAK,EAAE,GAAG;IACV,OAAO,EAAE,GAAG;IACZ,IAAI,EAAE,GAAG;IACT,WAAW,EAAE,GAAG;IAChB,IAAI,EAAE,GAAG;IACT,WAAW,EAAE,GAAG;IAChB,YAAY,EAAE,GAAG;IACjB,UAAU,EAAE,IAAI;IAChB,iBAAiB,EAAE,IAAI;CACxB,CAAC;AAEF,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,oEAAoE;AACpE,MAAM,UAAU,eAAe,CAAC,MAAM;IACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,IAAI,GAAG,KAAK,GAAG;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;IACxB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,MAAM,CAAC,CAAC;IACf,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AACvC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE;IACtD,MAAM,CAAC,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,IAAI,YAAY,CAAC;IAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,IAAI,mBAAmB,CAAC;IAE1D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnC,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,cAAc,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAErD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,UAAU,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;QACrC,MAAM,SAAS,GACb,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC;YACvB,CAAC,CAAC,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC;YAChC,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC;YACvB,CAAC,CAAC,IAAI,GAAG,UAAU;YACnB,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAEpB,OAAO;YACL,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YACzC,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,UAAU;YACV,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC;SAC7B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/graph/classifiers/roles.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Classify nodes into architectural roles based on fan-in/fan-out metrics.
+ *
+ * @param {{ id: string, name: string, kind?: string, file?: string, fanIn: number, fanOut: number, isExported: boolean, testOnlyFanIn?: number }[]} nodes
+ * @returns {Map<string, string>} nodeId → role
+ */
+export function classifyRoles(nodes: {
+    id: string;
+    name: string;
+    kind?: string;
+    file?: string;
+    fanIn: number;
+    fanOut: number;
+    isExported: boolean;
+    testOnlyFanIn?: number;
+}[]): Map<string, string>;
+/**
+ * Node role classification — pure logic, no DB.
+ *
+ * Roles: entry, core, utility, adapter, leaf, dead-*, test-only
+ *
+ * Dead sub-categories refine the coarse "dead" bucket:
+ *   dead-leaf       — parameters, properties, constants (leaf nodes by definition)
+ *   dead-entry      — framework dispatch: CLI commands, MCP tools, event handlers
+ *   dead-ffi        — cross-language FFI boundaries (e.g. Rust napi-rs bindings)
+ *   dead-unresolved — genuinely unreferenced callables (the real dead code)
+ */
+export const FRAMEWORK_ENTRY_PREFIXES: string[];
+//# sourceMappingURL=roles.d.ts.map

package/dist/graph/classifiers/roles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"roles.d.ts","sourceRoot":"","sources":["../../../src/graph/classifiers/roles.js"],"names":[],"mappings":"AA8DA;;;;;GAKG;AACH,qCAHW;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,OAAO,CAAC;IAAC,aAAa,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,GACtI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgD/B;AAlHD;;;;;;;;;;GAUG;AAEH,gDAAyE"}

package/dist/graph/classifiers/roles.js

@@ -0,0 +1,109 @@
+/**
+ * Node role classification — pure logic, no DB.
+ *
+ * Roles: entry, core, utility, adapter, leaf, dead-*, test-only
+ *
+ * Dead sub-categories refine the coarse "dead" bucket:
+ *   dead-leaf       — parameters, properties, constants (leaf nodes by definition)
+ *   dead-entry      — framework dispatch: CLI commands, MCP tools, event handlers
+ *   dead-ffi        — cross-language FFI boundaries (e.g. Rust napi-rs bindings)
+ *   dead-unresolved — genuinely unreferenced callables (the real dead code)
+ */
+export const FRAMEWORK_ENTRY_PREFIXES = ['route:', 'event:', 'command:'];
+// ── Dead sub-classification helpers ────────────────────────────────
+const LEAF_KINDS = new Set(['parameter', 'property', 'constant']);
+const FFI_EXTENSIONS = new Set(['.rs', '.c', '.cpp', '.h', '.go', '.java', '.cs']);
+/** Path patterns indicating framework-dispatched entry points. */
+const ENTRY_PATH_PATTERNS = [
+    /cli[/\\]commands[/\\]/,
+    /mcp[/\\]/,
+    /routes?[/\\]/,
+    /handlers?[/\\]/,
+    /middleware[/\\]/,
+];
+/**
+ * Refine a "dead" classification into a sub-category.
+ *
+ * @param {{ kind?: string, file?: string }} node
+ * @returns {'dead-leaf'|'dead-entry'|'dead-ffi'|'dead-unresolved'}
+ */
+function classifyDeadSubRole(node) {
+    // Leaf kinds are dead by definition — they can't have callers
+    if (node.kind && LEAF_KINDS.has(node.kind))
+        return 'dead-leaf';
+    if (node.file) {
+        // Cross-language FFI: compiled-language files in a JS/TS project
+        // Priority: dead-ffi is checked before dead-entry deliberately — an FFI
+        // boundary is a more fundamental classification than a path-based hint.
+        // A .so/.dll in a routes/ directory is still FFI, not an entry point.
+        const dotIdx = node.file.lastIndexOf('.');
+        if (dotIdx !== -1 && FFI_EXTENSIONS.has(node.file.slice(dotIdx)))
+            return 'dead-ffi';
+        // Framework-dispatched entry points (CLI commands, MCP tools, routes)
+        if (ENTRY_PATH_PATTERNS.some((p) => p.test(node.file)))
+            return 'dead-entry';
+    }
+    return 'dead-unresolved';
+}
+// ── Helpers ────────────────────────────────────────────────────────
+function median(sorted) {
+    if (sorted.length === 0)
+        return 0;
+    const mid = Math.floor(sorted.length / 2);
+    return sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+}
+/**
+ * Classify nodes into architectural roles based on fan-in/fan-out metrics.
+ *
+ * @param {{ id: string, name: string, kind?: string, file?: string, fanIn: number, fanOut: number, isExported: boolean, testOnlyFanIn?: number }[]} nodes
+ * @returns {Map<string, string>} nodeId → role
+ */
+export function classifyRoles(nodes) {
+    if (nodes.length === 0)
+        return new Map();
+    const nonZeroFanIn = nodes
+        .filter((n) => n.fanIn > 0)
+        .map((n) => n.fanIn)
+        .sort((a, b) => a - b);
+    const nonZeroFanOut = nodes
+        .filter((n) => n.fanOut > 0)
+        .map((n) => n.fanOut)
+        .sort((a, b) => a - b);
+    const medFanIn = median(nonZeroFanIn);
+    const medFanOut = median(nonZeroFanOut);
+    const result = new Map();
+    for (const node of nodes) {
+        const highIn = node.fanIn >= medFanIn && node.fanIn > 0;
+        const highOut = node.fanOut >= medFanOut && node.fanOut > 0;
+        const hasProdFanIn = typeof node.productionFanIn === 'number';
+        let role;
+        const isFrameworkEntry = FRAMEWORK_ENTRY_PREFIXES.some((p) => node.name.startsWith(p));
+        if (isFrameworkEntry) {
+            role = 'entry';
+        }
+        else if (node.fanIn === 0 && !node.isExported) {
+            role = node.testOnlyFanIn > 0 ? 'test-only' : classifyDeadSubRole(node);
+        }
+        else if (node.fanIn === 0 && node.isExported) {
+            role = 'entry';
+        }
+        else if (hasProdFanIn && node.fanIn > 0 && node.productionFanIn === 0) {
+            role = 'test-only';
+        }
+        else if (highIn && !highOut) {
+            role = 'core';
+        }
+        else if (highIn && highOut) {
+            role = 'utility';
+        }
+        else if (!highIn && highOut) {
+            role = 'adapter';
+        }
+        else {
+            role = 'leaf';
+        }
+        result.set(node.id, role);
+    }
+    return result;
+}
+//# sourceMappingURL=roles.js.map

package/dist/graph/classifiers/roles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"roles.js","sourceRoot":"","sources":["../../../src/graph/classifiers/roles.js"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AAEzE,sEAAsE;AAEtE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AAElE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAEnF,kEAAkE;AAClE,MAAM,mBAAmB,GAAG;IAC1B,uBAAuB;IACvB,UAAU;IACV,cAAc;IACd,gBAAgB;IAChB,iBAAiB;CAClB,CAAC;AAEF;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,IAAI;IAC/B,8DAA8D;IAC9D,IAAI,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,WAAW,CAAC;IAE/D,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,iEAAiE;QACjE,wEAAwE;QACxE,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;QAEpF,sEAAsE;QACtE,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,YAAY,CAAC;IAC9E,CAAC;IAED,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED,sEAAsE;AAEtE,SAAS,MAAM,CAAC,MAAM;IACpB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACrF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAAK;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAEzC,MAAM,YAAY,GAAG,KAAK;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;SACnB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;SACpB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEzB,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5D,MAAM,YAAY,GAAG,OAAO,IAAI,CAAC,eAAe,KAAK,QAAQ,CAAC;QAE9D,IAAI,IAAI,CAAC;QACT,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,IAAI,gBAAgB,EAAE,CAAC;YACrB,IAAI,GAAG,OAAO,CAAC;QACjB,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChD,IAAI,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/C,IAAI,GAAG,OAAO,CAAC;QACjB,CAAC;aAAM,IAAI,YAAY,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,eAAe,KAAK,CAAC,EAAE,CAAC;YACxE,IAAI,GAAG,WAAW,CAAC;QACrB,CAAC;aAAM,IAAI,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9B,IAAI,GAAG,MAAM,CAAC;QAChB,CAAC;aAAM,IAAI,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;aAAM,IAAI,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC;YAC9B,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,5 @@
+export { CodeGraph } from "./model.js";
+export { bfs, fanInOut, louvainCommunities, shortestPath, tarjan } from "./algorithms/index.js";
+export { buildDependencyGraph, buildStructureGraph, buildTemporalGraph } from "./builders/index.js";
+export { classifyRoles, DEFAULT_WEIGHTS, FRAMEWORK_ENTRY_PREFIXES, minMaxNormalize, ROLE_WEIGHTS, scoreRisk } from "./classifiers/index.js";
+//# sourceMappingURL=index.d.ts.map

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

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

package/dist/graph/index.js

@@ -0,0 +1,6 @@
+// Graph subsystem barrel export
+export { bfs, fanInOut, louvainCommunities, shortestPath, tarjan } from './algorithms/index.js';
+export { buildDependencyGraph, buildStructureGraph, buildTemporalGraph } from './builders/index.js';
+export { classifyRoles, DEFAULT_WEIGHTS, FRAMEWORK_ENTRY_PREFIXES, minMaxNormalize, ROLE_WEIGHTS, scoreRisk, } from './classifiers/index.js';
+export { CodeGraph } from './model.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.js"],"names":[],"mappings":"AAAA,gCAAgC;AAEhC,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAChG,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACpG,OAAO,EACL,aAAa,EACb,eAAe,EACf,wBAAwB,EACxB,eAAe,EACf,YAAY,EACZ,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/model.d.ts

@@ -0,0 +1,53 @@
+export class CodeGraph {
+    /**
+     * @param {{ directed?: boolean }} [opts]
+     */
+    constructor(opts?: {
+        directed?: boolean;
+    });
+    _directed: boolean;
+    /** @type {Map<string, object>} */
+    _nodes: Map<string, object>;
+    /** @type {Map<string, Map<string, object>>} node → (target → edgeAttrs) */
+    _successors: Map<string, Map<string, object>>;
+    /** @type {Map<string, Map<string, object>>} node → (source → edgeAttrs) */
+    _predecessors: Map<string, Map<string, object>>;
+    get directed(): boolean;
+    get nodeCount(): number;
+    get edgeCount(): number;
+    addNode(id: any, attrs?: {}): this;
+    hasNode(id: any): boolean;
+    getNodeAttrs(id: any): object | undefined;
+    /** @returns {IterableIterator<[string, object]>} */
+    nodes(): IterableIterator<[string, object]>;
+    /** @returns {string[]} */
+    nodeIds(): string[];
+    addEdge(source: any, target: any, attrs?: {}): this;
+    hasEdge(source: any, target: any): boolean;
+    getEdgeAttrs(source: any, target: any): object | undefined;
+    /** @yields {[string, string, object]} source, target, attrs */
+    edges(): Generator<(string | object)[], void, unknown>;
+    /** Direct successors of a node (outgoing edges). */
+    successors(id: any): string[];
+    /** Direct predecessors of a node (incoming edges). */
+    predecessors(id: any): string[];
+    /** All neighbors (union of successors + predecessors). */
+    neighbors(id: any): any[];
+    outDegree(id: any): number;
+    inDegree(id: any): number;
+    /** Return a new graph containing only nodes matching the predicate. */
+    subgraph(predicate: any): CodeGraph;
+    /** Return a new graph containing only edges matching the predicate. */
+    filterEdges(predicate: any): CodeGraph;
+    /** Convert to flat edge array for native Rust interop. */
+    toEdgeArray(): {
+        source: string | object | undefined;
+        target: string | object | undefined;
+    }[];
+    /** Convert to graphology instance (for Louvain etc). */
+    toGraphology(opts?: {}): any;
+    clone(): CodeGraph;
+    /** Merge another graph into this one. Nodes/edges from other override on conflict. */
+    merge(other: any): this;
+}
+//# sourceMappingURL=model.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../src/graph/model.js"],"names":[],"mappings":"AASA;IACE;;OAEG;IACH,mBAFW;QAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAE,EAUhC;IAPC,mBAAwC;IACxC,kCAAkC;IAClC,QADW,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CACP;IACvB,2EAA2E;IAC3E,aADW,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CACf;IAC5B,2EAA2E;IAC3E,eADW,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CACb;IAGhC,wBAEC;IAED,wBAEC;IAED,wBAKC;IAID,mCAMC;IAED,0BAEC;IAED,0CAEC;IAED,oDAAoD;IACpD,SADc,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAG/C;IAED,0BAA0B;IAC1B,WADc,MAAM,EAAE,CAGrB;IAID,oDAeC;IAED,2CAIC;IAED,2DAIC;IAED,+DAA+D;IAC/D,uDAaC;IAID,oDAAoD;IACpD,8BAIC;IAED,sDAAsD;IACtD,gCAIC;IAED,0DAA0D;IAC1D,0BAQC;IAED,2BAGC;IAED,0BAGC;IAID,uEAAuE;IACvE,oCAWC;IAED,uEAAuE;IACvE,uCAWC;IAID,0DAA0D;IAC1D;;;QAMC;IAED,wDAAwD;IACxD,6BAYC;IAID,mBASC;IAED,sFAAsF;IACtF,wBAQC;CACF"}