@monoes/monomindcli 1.6.0

package/dist/src/mcp-tools/graphify-tools.js

@@ -0,0 +1,1235 @@
+/**
+ * Graphify MCP Tools
+ *
+ * Bridges @monomind/graph's knowledge graph into monomind's MCP tool surface.
+ * Agents can query the codebase knowledge graph without reading files —
+ * god_nodes(), query_graph(), shortest_path() give structural understanding
+ * in milliseconds vs. reading dozens of source files.
+ *
+ * Graph is built automatically on `monomind init` and stored at
+ * .monomind/graph/graph.json (legacy: graphify-out/graph.json).
+ * Rebuild manually: call graphify_build via MCP.
+ */
+import { existsSync, readFileSync } from 'fs';
+import { join, resolve } from 'path';
+import { getProjectCwd } from './types.js';
+// ── Path helpers ──────────────────────────────────────────────────────────────
+/** Resolve graph path: prefer native monomind path, fall back to legacy graphify path. */
+function getGraphPath(cwd) {
+    const nativePath = resolve(join(cwd, '.monomind', 'graph', 'graph.json'));
+    const legacyPath = resolve(join(cwd, 'graphify-out', 'graph.json'));
+    if (existsSync(nativePath))
+        return nativePath;
+    if (existsSync(legacyPath))
+        return legacyPath;
+    return nativePath; // return expected path even if not yet built
+}
+function graphExists(cwd) {
+    return existsSync(getGraphPath(cwd));
+}
+/**
+ * Load the knowledge graph.
+ * Tries @monomind/graph's loadGraph first; falls back to parsing raw JSON.
+ */
+async function loadKnowledgeGraph(cwd) {
+    const graphPath = getGraphPath(cwd);
+    let rawNodes = [];
+    let rawEdges = [];
+    try {
+        // Prefer @monomind/graph's loader which handles format normalization.
+        const { loadGraph } = await import('@monomind/graph');
+        const loaded = loadGraph(graphPath);
+        rawNodes = loaded.nodes;
+        rawEdges = loaded.edges;
+    }
+    catch {
+        // Fallback: parse JSON directly
+        const data = JSON.parse(readFileSync(graphPath, 'utf-8'));
+        rawNodes = data.nodes || [];
+        rawEdges = data.links || data.edges || [];
+    }
+    // Build in-memory graph structures
+    const nodes = new Map();
+    for (const n of rawNodes) {
+        nodes.set(n.id, n);
+    }
+    const adj = new Map();
+    const radj = new Map();
+    const degree = new Map();
+    for (const n of rawNodes) {
+        adj.set(n.id, []);
+        radj.set(n.id, []);
+        degree.set(n.id, 0);
+    }
+    for (const e of rawEdges) {
+        const src = e.source;
+        const tgt = e.target;
+        adj.get(src)?.push(tgt);
+        radj.get(tgt)?.push(src);
+        degree.set(src, (degree.get(src) ?? 0) + 1);
+        degree.set(tgt, (degree.get(tgt) ?? 0) + 1);
+    }
+    return { nodes, adj, radj, edges: rawEdges, degree, graphPath };
+}
+// ── Shared output helpers ─────────────────────────────────────────────────────
+function nodeOut(g, id) {
+    const d = g.nodes.get(id) ?? { id };
+    return {
+        id,
+        label: d.label ?? id,
+        file: d.source_file ?? '',
+        location: d.source_location ?? '',
+        community: d.community ?? null,
+        degree: g.degree.get(id) ?? 0,
+        file_type: d.file_type ?? '',
+    };
+}
+/** Score a node against search terms. */
+function scoreNode(g, id, terms) {
+    const d = g.nodes.get(id);
+    if (!d)
+        return 0;
+    const label = (d.label ?? id).toLowerCase();
+    const file = (d.source_file ?? '').toLowerCase();
+    return terms.reduce((s, t) => {
+        if (label.includes(t))
+            s += 1;
+        if (file.includes(t))
+            s += 0.5;
+        return s;
+    }, 0);
+}
+// ── Tool Definitions ──────────────────────────────────────────────────────────
+/**
+ * Build or rebuild the knowledge graph for a directory.
+ */
+export const graphifyBuildTool = {
+    name: 'graphify_build',
+    description: 'Build (or rebuild) the knowledge graph for a project directory. ' +
+        'Extracts AST structure from code files, semantic relationships from docs, ' +
+        'and clusters them into communities. Run this first before using other graphify tools. ' +
+        'Code-only changes are fast (tree-sitter, no LLM). Doc changes require an LLM call.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'codebase', 'architecture', 'analysis'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Path to analyse (defaults to current project root)',
+            },
+            codeOnly: {
+                type: 'boolean',
+                description: 'Only re-extract changed code files — no LLM, fast rebuild',
+                default: false,
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        try {
+            const { buildGraph } = await import('@monomind/graph');
+            const outputDir = join(targetPath, '.monomind', 'graph');
+            const result = await buildGraph(targetPath, {
+                codeOnly: Boolean(params.codeOnly),
+                outputDir,
+            });
+            return {
+                success: true,
+                graphPath: result.graphPath,
+                reportPath: result.reportPath,
+                filesProcessed: result.filesProcessed,
+                fromCache: result.fromCache,
+                nodes: result.analysis.stats.nodes,
+                edges: result.analysis.stats.edges,
+                communities: result.analysis.stats.communities,
+                graphQuality: result.graphQuality,
+                experimentStatus: result.experimentStatus,
+                corpusWarnings: result.corpusWarnings,
+                message: `[${result.experimentStatus}] Knowledge graph built — quality=${result.graphQuality.toFixed(4)} (${result.analysis.stats.nodes}n/${result.analysis.stats.edges}e/${result.analysis.stats.communities}c)`,
+            };
+        }
+        catch (err) {
+            return {
+                error: true,
+                message: String(err),
+                hint: '@monomind/graph package not available — ensure it is installed and built.',
+            };
+        }
+    },
+};
+/**
+ * Query the knowledge graph with natural language.
+ */
+export const graphifyQueryTool = {
+    name: 'graphify_query',
+    description: 'Search the knowledge graph with a natural language question or keywords. ' +
+        'Returns relevant nodes and edges as structured context — use this instead of reading ' +
+        'many files when you want to understand how components relate. ' +
+        'BFS mode gives broad context; DFS traces a specific call path.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'search', 'architecture', 'codebase'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            question: {
+                type: 'string',
+                description: 'Natural language question or keyword (e.g. "authentication flow", "how does caching work")',
+            },
+            mode: {
+                type: 'string',
+                enum: ['bfs', 'dfs'],
+                default: 'bfs',
+                description: 'bfs = broad context, dfs = trace specific path',
+            },
+            depth: {
+                type: 'integer',
+                default: 3,
+                description: 'Traversal depth (1–6)',
+            },
+            tokenBudget: {
+                type: 'integer',
+                default: 2000,
+                description: 'Approximate max output tokens',
+            },
+            path: {
+                type: 'string',
+                description: 'Project path whose graph to query (defaults to current project root)',
+            },
+        },
+        required: ['question'],
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return {
+                error: true,
+                message: 'No graph found. Run graphify_build first.',
+                hint: `Expected: ${getGraphPath(targetPath)}`,
+            };
+        }
+        const question = params.question;
+        const mode = params.mode || 'bfs';
+        const depth = params.depth || 3;
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const terms = question.toLowerCase().split(/\s+/).filter(t => t.length > 2);
+            // Score nodes; fall back to highest-degree nodes if no match
+            let startNodes = [];
+            if (terms.length > 0) {
+                const scored = [];
+                for (const id of g.nodes.keys()) {
+                    const s = scoreNode(g, id, terms);
+                    if (s > 0)
+                        scored.push([s, id]);
+                }
+                scored.sort((a, b) => b[0] - a[0]);
+                startNodes = scored.slice(0, 5).map(([, id]) => id);
+            }
+            if (startNodes.length === 0) {
+                startNodes = [...g.nodes.keys()]
+                    .sort((a, b) => (g.degree.get(b) ?? 0) - (g.degree.get(a) ?? 0))
+                    .slice(0, 3);
+            }
+            const visited = new Set(startNodes);
+            const edgesSeen = [];
+            if (mode === 'bfs') {
+                let frontier = new Set(startNodes);
+                for (let d = 0; d < depth; d++) {
+                    const next = new Set();
+                    for (const n of frontier) {
+                        for (const nbr of g.adj.get(n) ?? []) {
+                            if (!visited.has(nbr)) {
+                                next.add(nbr);
+                                edgesSeen.push([n, nbr]);
+                            }
+                        }
+                    }
+                    for (const n of next)
+                        visited.add(n);
+                    frontier = next;
+                }
+            }
+            else {
+                // DFS
+                const stack = startNodes.map(n => [n, 0]);
+                while (stack.length > 0) {
+                    const [node, d] = stack.pop();
+                    if (visited.has(node) && d > 0)
+                        continue;
+                    if (d > depth)
+                        continue;
+                    visited.add(node);
+                    for (const nbr of g.adj.get(node) ?? []) {
+                        if (!visited.has(nbr)) {
+                            stack.push([nbr, d + 1]);
+                            edgesSeen.push([node, nbr]);
+                        }
+                    }
+                }
+            }
+            const nodesOut = [...visited]
+                .sort((a, b) => (g.degree.get(b) ?? 0) - (g.degree.get(a) ?? 0))
+                .slice(0, 60)
+                .map(id => nodeOut(g, id));
+            // Build edge lookup for attribute access
+            const edgeLookup = new Map();
+            for (const e of g.edges) {
+                edgeLookup.set(`${e.source}__${e.target}`, e);
+            }
+            const edgesOut = edgesSeen
+                .filter(([u, v]) => visited.has(u) && visited.has(v))
+                .slice(0, 80)
+                .map(([u, v]) => {
+                const e = edgeLookup.get(`${u}__${v}`) ?? {};
+                return {
+                    from: (g.nodes.get(u)?.label ?? u),
+                    to: (g.nodes.get(v)?.label ?? v),
+                    relation: e.relation ?? '',
+                    confidence: e.confidence ?? '',
+                };
+            });
+            return {
+                question,
+                mode,
+                depth,
+                nodes: nodesOut,
+                edges: edgesOut,
+                total_nodes: visited.size,
+                total_edges: edgesSeen.length,
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Get the most connected (god) nodes — the core abstractions.
+ */
+export const graphifyGodNodesTool = {
+    name: 'graphify_god_nodes',
+    description: 'Return the most connected nodes in the knowledge graph — the core abstractions ' +
+        'and central concepts of the codebase. Use this at the start of any architectural analysis ' +
+        'to understand what the most important components are before diving into details.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'architecture', 'abstractions', 'codebase'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            topN: {
+                type: 'integer',
+                default: 15,
+                description: 'Number of god nodes to return',
+            },
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return {
+                error: true,
+                message: 'No graph found. Run graphify_build first.',
+            };
+        }
+        const topN = params.topN || 15;
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const sortedIds = [...g.nodes.keys()]
+                .filter(id => {
+                const source_file = g.nodes.get(id)?.source_file ?? '';
+                return source_file !== '';
+            })
+                .sort((a, b) => (g.degree.get(b) ?? 0) - (g.degree.get(a) ?? 0))
+                .slice(0, topN);
+            const godNodes = sortedIds.map(id => {
+                const d = g.nodes.get(id) ?? { id };
+                const neighbors = (g.adj.get(id) ?? [])
+                    .slice(0, 8)
+                    .map(nid => g.nodes.get(nid)?.label ?? nid);
+                return {
+                    label: d.label ?? id,
+                    degree: g.degree.get(id) ?? 0,
+                    file: d.source_file ?? '',
+                    location: d.source_location ?? '',
+                    community: d.community ?? null,
+                    file_type: d.file_type ?? '',
+                    neighbors,
+                };
+            });
+            const internalCount = [...g.nodes.keys()].filter(id => (g.nodes.get(id)?.source_file ?? '') !== '').length;
+            return { god_nodes: godNodes, total_nodes: g.nodes.size, internal_nodes: internalCount };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Get full details for a specific node.
+ */
+export const graphifyGetNodeTool = {
+    name: 'graphify_get_node',
+    description: 'Get all details for a specific concept/node in the knowledge graph: ' +
+        'its source location, community, all relationships, and confidence levels. ' +
+        'Use this when you need to deeply understand one specific component.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'node', 'details'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            label: {
+                type: 'string',
+                description: 'Node label or ID to look up (case-insensitive)',
+            },
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+        required: ['label'],
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return { error: true, message: 'No graph found. Run graphify_build first.' };
+        }
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const term = params.label.toLowerCase();
+            const matches = [...g.nodes.entries()]
+                .filter(([id, d]) => (d.label ?? id).toLowerCase().includes(term) || id.toLowerCase() === term)
+                .sort(([aId], [bId]) => (g.degree.get(bId) ?? 0) - (g.degree.get(aId) ?? 0))
+                .map(([id]) => id);
+            if (matches.length === 0) {
+                return { error: 'Node not found', searched: term };
+            }
+            const id = matches[0];
+            const d = g.nodes.get(id) ?? { id };
+            // Build edge lookup
+            const edgeLookup = new Map();
+            for (const e of g.edges) {
+                edgeLookup.set(`${e.source}__${e.target}`, e);
+            }
+            const outEdges = (g.adj.get(id) ?? []).slice(0, 40).map(tgt => {
+                const e = edgeLookup.get(`${id}__${tgt}`) ?? {};
+                return {
+                    direction: 'outgoing',
+                    to: g.nodes.get(tgt)?.label ?? tgt,
+                    relation: e.relation ?? '',
+                    confidence: e.confidence ?? '',
+                    confidence_score: e.confidence_score ?? null,
+                };
+            });
+            const inEdges = (g.radj.get(id) ?? []).slice(0, 40).map(src => {
+                const e = edgeLookup.get(`${src}__${id}`) ?? {};
+                return {
+                    direction: 'incoming',
+                    from: g.nodes.get(src)?.label ?? src,
+                    relation: e.relation ?? '',
+                    confidence: e.confidence ?? '',
+                };
+            });
+            // Strip well-known fields from attributes output to avoid duplication
+            const knownKeys = new Set(['label', 'source_file', 'source_location', 'community', 'file_type', 'id']);
+            const attributes = {};
+            for (const [k, v] of Object.entries(d)) {
+                if (!knownKeys.has(k))
+                    attributes[k] = v;
+            }
+            return {
+                id,
+                label: d.label ?? id,
+                file: d.source_file ?? '',
+                location: d.source_location ?? '',
+                community: d.community ?? null,
+                file_type: d.file_type ?? '',
+                degree: g.degree.get(id) ?? 0,
+                attributes,
+                edges: [...outEdges, ...inEdges],
+                all_matches: matches.slice(0, 10).map(m => g.nodes.get(m)?.label ?? m),
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Find shortest path between two concepts.
+ */
+export const graphifyShortestPathTool = {
+    name: 'graphify_shortest_path',
+    description: 'Find the shortest relationship path between two concepts in the knowledge graph. ' +
+        'Use this to trace how component A depends on or relates to component B, ' +
+        'revealing hidden coupling chains (e.g. "how does the router connect to the database?").',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'path', 'dependencies', 'coupling'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            source: { type: 'string', description: 'Source concept label' },
+            target: { type: 'string', description: 'Target concept label' },
+            maxHops: { type: 'integer', default: 8, description: 'Maximum hops to search' },
+            path: { type: 'string', description: 'Project path (defaults to current project root)' },
+        },
+        required: ['source', 'target'],
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return { error: true, message: 'No graph found. Run graphify_build first.' };
+        }
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const maxHops = params.maxHops || 8;
+            /** Find node ids matching a search term, sorted by degree descending. */
+            function findNodes(term) {
+                const t = term.toLowerCase();
+                return [...g.nodes.entries()]
+                    .filter(([id, d]) => (d.label ?? id).toLowerCase().includes(t) || id.toLowerCase() === t)
+                    .sort(([aId], [bId]) => (g.degree.get(bId) ?? 0) - (g.degree.get(aId) ?? 0))
+                    .map(([id]) => id);
+            }
+            const srcNodes = findNodes(params.source);
+            const tgtNodes = findNodes(params.target);
+            if (srcNodes.length === 0) {
+                return { error: true, message: `Source not found: ${params.source}` };
+            }
+            if (tgtNodes.length === 0) {
+                return { error: true, message: `Target not found: ${params.target}` };
+            }
+            // BFS on undirected graph (use both adj and radj as neighbours)
+            function bfsPath(start, end) {
+                const prev = new Map();
+                const queue = [start];
+                const visited = new Set([start]);
+                while (queue.length > 0) {
+                    const cur = queue.shift();
+                    if (cur === end) {
+                        // Reconstruct path
+                        const path = [];
+                        let node = end;
+                        while (node !== undefined) {
+                            path.unshift(node);
+                            node = prev.get(node);
+                        }
+                        return path.length - 1 <= maxHops ? path : null;
+                    }
+                    // Treat edges as undirected
+                    const nbrs = [...(g.adj.get(cur) ?? []), ...(g.radj.get(cur) ?? [])];
+                    for (const nbr of nbrs) {
+                        if (!visited.has(nbr)) {
+                            visited.add(nbr);
+                            prev.set(nbr, cur);
+                            if (queue.length < 100000)
+                                queue.push(nbr);
+                        }
+                    }
+                }
+                return null;
+            }
+            let bestPath = null;
+            for (const src of srcNodes.slice(0, 3)) {
+                for (const tgt of tgtNodes.slice(0, 3)) {
+                    const p = bfsPath(src, tgt);
+                    if (p && (!bestPath || p.length < bestPath.length)) {
+                        bestPath = p;
+                    }
+                }
+            }
+            if (!bestPath) {
+                return {
+                    found: false,
+                    message: `No path within ${maxHops} hops between "${params.source}" and "${params.target}"`,
+                };
+            }
+            // Build edge lookup
+            const edgeLookup = new Map();
+            for (const e of g.edges) {
+                edgeLookup.set(`${e.source}__${e.target}`, e);
+                edgeLookup.set(`${e.target}__${e.source}`, e); // bidirectional lookup
+            }
+            const steps = bestPath.map((id, i) => {
+                const d = g.nodes.get(id) ?? { id };
+                const step = {
+                    label: d.label ?? id,
+                    file: d.source_file ?? '',
+                    location: d.source_location ?? '',
+                };
+                if (i < bestPath.length - 1) {
+                    const nextId = bestPath[i + 1];
+                    const e = edgeLookup.get(`${id}__${nextId}`) ?? edgeLookup.get(`${nextId}__${id}`) ?? {};
+                    step.next_relation = e.relation ?? '';
+                    step.confidence = e.confidence ?? '';
+                }
+                return step;
+            });
+            return { found: true, hops: bestPath.length - 1, path: steps };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Get all nodes in a community (cluster of related components).
+ */
+export const graphifyGetCommunityTool = {
+    name: 'graphify_community',
+    description: 'Get all nodes in a specific community cluster. Communities are groups of ' +
+        'tightly related components detected by graph clustering. Use graph_stats first to ' +
+        'see community count, then explore communities to understand subsystem boundaries.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'community', 'clusters', 'subsystems'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            communityId: {
+                type: 'integer',
+                description: 'Community ID (0 = largest community)',
+            },
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+        required: ['communityId'],
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return { error: true, message: 'No graph found. Run graphify_build first.' };
+        }
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const cid = params.communityId;
+            const members = [...g.nodes.entries()]
+                .filter(([, d]) => d.community === cid)
+                .sort(([aId], [bId]) => (g.degree.get(bId) ?? 0) - (g.degree.get(aId) ?? 0))
+                .slice(0, 50)
+                .map(([id, d]) => ({
+                label: d.label ?? id,
+                file: d.source_file ?? '',
+                location: d.source_location ?? '',
+                degree: g.degree.get(id) ?? 0,
+                file_type: d.file_type ?? '',
+            }));
+            // Build edge lookup
+            const edgeLookup = new Map();
+            for (const e of g.edges) {
+                edgeLookup.set(`${e.source}__${e.target}`, e);
+            }
+            const externalEdges = [];
+            for (const [id, d] of g.nodes.entries()) {
+                if (d.community !== cid)
+                    continue;
+                for (const nbr of g.adj.get(id) ?? []) {
+                    const nbrD = g.nodes.get(nbr);
+                    if (nbrD?.community !== cid) {
+                        const e = edgeLookup.get(`${id}__${nbr}`) ?? {};
+                        externalEdges.push({
+                            from: d.label ?? id,
+                            to: nbrD?.label ?? nbr,
+                            to_community: nbrD?.community ?? null,
+                            relation: e.relation ?? '',
+                        });
+                    }
+                }
+            }
+            return {
+                community_id: cid,
+                member_count: members.length,
+                members,
+                external_connections: externalEdges.slice(0, 30),
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Get graph statistics: node/edge counts, communities, confidence breakdown.
+ */
+export const graphifyStatsTool = {
+    name: 'graphify_stats',
+    description: 'Get summary statistics for the knowledge graph: node count, edge count, ' +
+        'community count, confidence breakdown (EXTRACTED/INFERRED/AMBIGUOUS), ' +
+        'and top god nodes. Use this first to understand graph size and structure.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'stats', 'overview'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return {
+                error: true,
+                message: 'No graph found. Run graphify_build first.',
+                hint: `Expected: ${getGraphPath(targetPath)}`,
+            };
+        }
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            // Community sizes
+            const communities = new Map();
+            for (const d of g.nodes.values()) {
+                if (d.community != null) {
+                    communities.set(d.community, (communities.get(d.community) ?? 0) + 1);
+                }
+            }
+            const communitySizes = {};
+            [...communities.entries()]
+                .sort((a, b) => b[1] - a[1])
+                .slice(0, 10)
+                .forEach(([cid, count]) => { communitySizes[String(cid)] = count; });
+            // Confidence and relation counts
+            const confidenceCounts = {};
+            const relationCounts = {};
+            const fileTypeCounts = {};
+            for (const e of g.edges) {
+                const conf = e.confidence ?? 'UNKNOWN';
+                confidenceCounts[conf] = (confidenceCounts[conf] ?? 0) + 1;
+                const rel = e.relation ?? 'unknown';
+                relationCounts[rel] = (relationCounts[rel] ?? 0) + 1;
+            }
+            for (const d of g.nodes.values()) {
+                const ft = d.file_type ?? 'unknown';
+                fileTypeCounts[ft] = (fileTypeCounts[ft] ?? 0) + 1;
+            }
+            const topRelations = Object.entries(relationCounts)
+                .sort((a, b) => b[1] - a[1])
+                .slice(0, 10)
+                .reduce((acc, [k, v]) => { acc[k] = v; return acc; }, {});
+            const topGodNodes = [...g.nodes.keys()]
+                .filter(id => {
+                const source_file = g.nodes.get(id)?.source_file ?? '';
+                return source_file !== '';
+            })
+                .sort((a, b) => (g.degree.get(b) ?? 0) - (g.degree.get(a) ?? 0))
+                .slice(0, 5)
+                .map(id => g.nodes.get(id)?.label ?? id);
+            return {
+                nodes: g.nodes.size,
+                edges: g.edges.length,
+                communities: communities.size,
+                community_sizes: communitySizes,
+                confidence: confidenceCounts,
+                top_relations: topRelations,
+                file_types: fileTypeCounts,
+                graph_path: g.graphPath,
+                top_god_nodes: topGodNodes,
+                is_directed: true,
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Find surprising cross-community connections (architectural insights).
+ */
+export const graphifySurprisesTool = {
+    name: 'graphify_surprises',
+    description: 'Find surprising connections between components that are in different communities ' +
+        'but have strong relationships. These unexpected couplings often reveal hidden dependencies, ' +
+        'design smells, or important architectural patterns worth understanding.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'architecture', 'coupling', 'surprises'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            topN: {
+                type: 'integer',
+                default: 10,
+                description: 'Number of surprising connections to return',
+            },
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return { error: true, message: 'No graph found. Run graphify_build first.' };
+        }
+        try {
+            const g = await loadKnowledgeGraph(targetPath);
+            const topN = params.topN || 10;
+            const surprises = [];
+            for (const e of g.edges) {
+                const uD = g.nodes.get(e.source);
+                const vD = g.nodes.get(e.target);
+                const cu = uD?.community ?? null;
+                const cv = vD?.community ?? null;
+                if (cu != null && cv != null && cu !== cv) {
+                    const score = (g.degree.get(e.source) ?? 0) * (g.degree.get(e.target) ?? 0);
+                    surprises.push({
+                        score,
+                        from: uD?.label ?? e.source,
+                        from_community: cu,
+                        from_file: uD?.source_file ?? '',
+                        to: vD?.label ?? e.target,
+                        to_community: cv,
+                        to_file: vD?.source_file ?? '',
+                        relation: e.relation ?? '',
+                        confidence: e.confidence ?? '',
+                    });
+                }
+            }
+            surprises.sort((a, b) => b.score - a.score);
+            return {
+                surprises: surprises.slice(0, topN),
+                total_cross_community_edges: surprises.length,
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Generate or open the interactive HTML visualization of the knowledge graph.
+ */
+export const graphifyVisualizeTool = {
+    name: 'graphify_visualize',
+    description: 'Generate (and optionally open) the interactive HTML knowledge graph explorer. ' +
+        'Produces graph.html alongside graph.json — a self-contained visualization with force-directed ' +
+        'layout, community coloring, god-node panel, sidebar details, minimap, and search. ' +
+        'No internet connection or server required — just open the HTML file in a browser.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'visualization', 'html', 'browser'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            open: {
+                type: 'boolean',
+                description: 'Open the HTML file in the default browser after generating (macOS/Linux)',
+                default: false,
+            },
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return {
+                error: true,
+                message: 'No graph found. Run graphify_build first.',
+                hint: `Expected: ${getGraphPath(targetPath)}`,
+            };
+        }
+        try {
+            const graphPath = getGraphPath(targetPath);
+            const { readFileSync } = await import('fs');
+            const { join, dirname } = await import('path');
+            const outputDir = dirname(graphPath);
+            const { exportHTML } = await import('@monomind/graph');
+            const raw = JSON.parse(readFileSync(graphPath, 'utf-8'));
+            const htmlPath = exportHTML(raw, outputDir);
+            if (params.open) {
+                const { spawn } = await import('child_process');
+                const opener = process.platform === 'darwin' ? 'open'
+                    : process.platform === 'win32' ? 'start' : 'xdg-open';
+                spawn(opener, [htmlPath], { detached: true, stdio: 'ignore' }).unref();
+            }
+            return {
+                success: true,
+                htmlPath,
+                message: `Interactive visualization generated at ${htmlPath}`,
+                hint: params.open ? 'Opening in browser…' : `Open in browser: open "${htmlPath}"`,
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+// ── Watch PID helpers ─────────────────────────────────────────────────────────
+function getPidPath(cwd) {
+    return resolve(join(cwd, '.monomind', 'graph', 'watch.pid'));
+}
+function readWatchPid(cwd) {
+    const pidPath = getPidPath(cwd);
+    if (!existsSync(pidPath))
+        return null;
+    try {
+        const pid = parseInt(readFileSync(pidPath, 'utf-8').trim(), 10);
+        return isNaN(pid) ? null : pid;
+    }
+    catch {
+        return null;
+    }
+}
+function isProcessRunning(pid) {
+    try {
+        process.kill(pid, 0);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+// ── Watch tools ───────────────────────────────────────────────────────────────
+/**
+ * Start a background file watcher that rebuilds the knowledge graph + HTML
+ * whenever source files change (debounced 2 s).
+ */
+export const graphifyWatchTool = {
+    name: 'graphify_watch',
+    description: 'Start a background file watcher that automatically rebuilds the knowledge graph ' +
+        '(graph.json + graph.html) whenever source files change. Uses a 2-second debounce ' +
+        'so rapid saves do not trigger repeated rebuilds. The watcher runs as a detached ' +
+        'background process — call graphify_watch_stop to stop it.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'watch', 'auto-rebuild'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project root to watch (defaults to current project root)',
+            },
+            debounce: {
+                type: 'number',
+                description: 'Debounce delay in milliseconds (default 2000)',
+                default: 2000,
+            },
+            extensions: {
+                type: 'string',
+                description: 'Comma-separated list of file extensions to watch (default: ts,js,tsx,jsx,py,go,rs,java,cs,rb,cpp,c)',
+                default: 'ts,js,tsx,jsx,py,go,rs,java,cs,rb,cpp,c',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        const debounceMs = params.debounce || 2000;
+        const extensions = (params.extensions || 'ts,js,tsx,jsx,py,go,rs,java,cs,rb,cpp,c')
+            .split(',')
+            .map((e) => e.trim())
+            .filter(Boolean);
+        // Check if already running
+        const existingPid = readWatchPid(targetPath);
+        if (existingPid !== null && isProcessRunning(existingPid)) {
+            return {
+                success: false,
+                message: `Watcher already running (PID ${existingPid})`,
+                hint: 'Call graphify_watch_stop first to restart.',
+            };
+        }
+        const pidPath = getPidPath(targetPath);
+        const outputDir = resolve(join(targetPath, '.monomind', 'graph'));
+        // Inline watcher script — runs as a detached node process
+        const watcherScript = `
+import { watch } from 'chokidar';
+import { writeFileSync, mkdirSync } from 'fs';
+import { join } from 'path';
+
+const TARGET = ${JSON.stringify(targetPath)};
+const OUTPUT_DIR = ${JSON.stringify(outputDir)};
+const PID_PATH = ${JSON.stringify(pidPath)};
+const DEBOUNCE_MS = ${debounceMs};
+const EXTS = new Set(${JSON.stringify(extensions)});
+const IGNORE = [
+  /node_modules/,
+  /\\.git/,
+  /\\.monomind/,
+  /dist[\\\\/]/,
+  /\\.next/,
+  /\\.turbo/,
+  /coverage/,
+];
+
+// Write own PID
+mkdirSync(OUTPUT_DIR, { recursive: true });
+writeFileSync(PID_PATH, String(process.pid));
+
+console.log('[graphify-watch] PID', process.pid, '— watching', TARGET);
+
+let timer = null;
+
+async function rebuild() {
+  const start = Date.now();
+  console.log('[graphify-watch] Change detected — rebuilding graph…');
+  try {
+    const { buildGraph } = await import('@monomind/graph');
+    const { graph: serialized } = await buildGraph(TARGET, { outputDir: OUTPUT_DIR });
+    const { exportHTML } = await import('@monomind/graph');
+    exportHTML(serialized, OUTPUT_DIR);
+    console.log('[graphify-watch] Done in', Date.now() - start, 'ms');
+  } catch (err) {
+    console.error('[graphify-watch] Build error:', err.message ?? err);
+  }
+}
+
+const watcher = watch(TARGET, {
+  ignored: (p) => IGNORE.some((r) => r.test(p)),
+  persistent: true,
+  ignoreInitial: true,
+  awaitWriteFinish: { stabilityThreshold: 300, pollInterval: 100 },
+});
+
+watcher.on('all', (event, filePath) => {
+  const ext = filePath.split('.').pop() ?? '';
+  if (!EXTS.has(ext)) return;
+  if (timer) clearTimeout(timer);
+  timer = setTimeout(rebuild, DEBOUNCE_MS);
+});
+
+watcher.on('error', (err) => console.error('[graphify-watch] Watcher error:', err));
+
+// Clean up PID on exit
+process.on('exit', () => { try { require('fs').unlinkSync(PID_PATH); } catch {} });
+process.on('SIGINT', () => process.exit(0));
+process.on('SIGTERM', () => process.exit(0));
+`;
+        try {
+            const { spawn } = await import('child_process');
+            const { writeFileSync } = await import('fs');
+            const { mkdirSync } = await import('fs');
+            mkdirSync(outputDir, { recursive: true });
+            // Write the script to a temp file so it can use ESM imports
+            const scriptPath = resolve(join(outputDir, '_watcher.mjs'));
+            writeFileSync(scriptPath, watcherScript);
+            const child = spawn(process.execPath, [scriptPath], {
+                detached: true,
+                stdio: 'ignore',
+                env: { ...process.env },
+            });
+            child.unref();
+            // Give the process a moment to write its own PID
+            await new Promise((r) => setTimeout(r, 500));
+            const pid = readWatchPid(targetPath) ?? child.pid;
+            return {
+                success: true,
+                pid,
+                watching: targetPath,
+                debounceMs,
+                extensions,
+                message: `Graph watcher started (PID ${pid}). graph.json + graph.html will rebuild on file changes.`,
+                hint: 'Call graphify_watch_stop to stop.',
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Stop the background graph watcher started by graphify_watch.
+ */
+export const graphifyWatchStopTool = {
+    name: 'graphify_watch_stop',
+    description: 'Stop the background file watcher started by graphify_watch.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'watch'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project root (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        const pid = readWatchPid(targetPath);
+        if (pid === null) {
+            return { success: false, message: 'No watcher PID found — watcher may not be running.' };
+        }
+        if (!isProcessRunning(pid)) {
+            // Clean up stale PID file
+            try {
+                const { unlinkSync } = await import('fs');
+                unlinkSync(getPidPath(targetPath));
+            }
+            catch { /* ignore */ }
+            return { success: false, message: `Process ${pid} is not running (stale PID cleaned up).` };
+        }
+        try {
+            process.kill(pid, 'SIGTERM');
+            // Remove PID file
+            try {
+                const { unlinkSync } = await import('fs');
+                unlinkSync(getPidPath(targetPath));
+            }
+            catch { /* ignore */ }
+            return { success: true, message: `Watcher (PID ${pid}) stopped.` };
+        }
+        catch (err) {
+            return { error: true, message: `Failed to stop PID ${pid}: ${String(err)}` };
+        }
+    },
+};
+/**
+ * Read the GRAPH_REPORT.md generated during the last build.
+ */
+export const graphifyReportTool = {
+    name: 'graphify_report',
+    description: 'Read the GRAPH_REPORT.md generated by the last graphify_build. ' +
+        'Returns the full markdown audit trail: corpus check, god nodes, surprising connections, ' +
+        'communities, ambiguous edges, knowledge gaps, and suggested questions.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'report', 'audit'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        const reportPath = resolve(join(targetPath, '.monomind', 'graph', 'GRAPH_REPORT.md'));
+        if (!existsSync(reportPath)) {
+            return {
+                error: true,
+                message: 'No report found. Run graphify_build first.',
+                hint: `Expected: ${reportPath}`,
+            };
+        }
+        try {
+            const content = readFileSync(reportPath, 'utf-8');
+            return { success: true, reportPath, content };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Suggest questions the knowledge graph can answer about the codebase.
+ */
+export const graphifySuggestTool = {
+    name: 'graphify_suggest',
+    description: 'Return a prioritised list of questions this knowledge graph is uniquely ' +
+        'positioned to answer — e.g. bridge nodes between subsystems, god nodes worth investigating, ' +
+        'isolated components with no connections, and low-cohesion communities. ' +
+        'Use after graphify_build to guide architectural analysis.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'questions', 'analysis'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        if (!graphExists(targetPath)) {
+            return { error: true, message: 'No graph found. Run graphify_build first.' };
+        }
+        try {
+            const { loadGraph, suggestQuestions, buildAnalysis } = await import('@monomind/graph');
+            const graphPath = getGraphPath(targetPath);
+            const outputDir = resolve(join(targetPath, '.monomind', 'graph'));
+            const { buildGraphologyGraph } = await import('@monomind/graph');
+            const raw = loadGraph(graphPath);
+            const graph = buildGraphologyGraph({ nodes: raw.nodes, edges: raw.edges, hyperedges: [], filesProcessed: 0, fromCache: 0, errors: [] });
+            const analysis = buildAnalysis(graph, outputDir);
+            const questions = suggestQuestions(graph, analysis.communities);
+            return { success: true, questions, total: questions.length };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+/**
+ * Run a corpus health check on the project files.
+ */
+export const graphifyHealthTool = {
+    name: 'graphify_health',
+    description: 'Run a corpus health check on the project directory — warns when the codebase ' +
+        'is too small for graph analysis, too large to be useful, security-sensitive files were ' +
+        'found, or when the doc-to-code ratio is skewed. Run before graphify_build to catch issues early.',
+    category: 'graphify',
+    tags: ['knowledge-graph', 'health', 'corpus'],
+    inputSchema: {
+        type: 'object',
+        properties: {
+            path: {
+                type: 'string',
+                description: 'Project path (defaults to current project root)',
+            },
+        },
+    },
+    handler: async (params) => {
+        const cwd = getProjectCwd();
+        const targetPath = params.path || cwd;
+        try {
+            const { collectFiles, corpusHealth } = await import('@monomind/graph');
+            const files = collectFiles(targetPath);
+            const warnings = corpusHealth(files);
+            return {
+                success: true,
+                totalFiles: files.length,
+                warnings,
+                healthy: warnings.length === 0,
+                message: warnings.length === 0
+                    ? `Corpus looks healthy (${files.length} files).`
+                    : `${warnings.length} warning(s) found.`,
+            };
+        }
+        catch (err) {
+            return { error: true, message: String(err) };
+        }
+    },
+};
+// ── Exports ───────────────────────────────────────────────────────────────────
+export const graphifyTools = [
+    graphifyBuildTool,
+    graphifyQueryTool,
+    graphifyGodNodesTool,
+    graphifyGetNodeTool,
+    graphifyShortestPathTool,
+    graphifyGetCommunityTool,
+    graphifyStatsTool,
+    graphifySurprisesTool,
+    graphifyVisualizeTool,
+    graphifyWatchTool,
+    graphifyWatchStopTool,
+    graphifyReportTool,
+    graphifySuggestTool,
+    graphifyHealthTool,
+];
+export default graphifyTools;
+//# sourceMappingURL=graphify-tools.js.map