@ebowwa/dependency-graph-mcp 1.0.0 → 1.1.0

package/README.md

@@ -1,4 +1,4 @@
-# @mcp/dependency-graph
+# @ebowwa/dependency-graph-mcp
 
 MCP server for dependency graph analysis and visualization in monorepos.
 
@@ -14,7 +14,9 @@ MCP server for dependency graph analysis and visualization in monorepos.
 ## Installation
 
 ```bash
-bun add @mcp/dependency-graph
+bun add @ebowwa/dependency-graph-mcp
+# or
+npm install @ebowwa/dependency-graph-mcp
 ```
 
 ## MCP Tools
@@ -44,7 +46,7 @@ Analyze the impact of changing a specific package.
 
 ```json
 {
-  "package": "@codespaces/terminal",
+  "package": "@ebowwa/terminal",
   "includeTransitive": true,
   "format": "tree"
 }
@@ -76,7 +78,7 @@ Get detailed information about a specific package.
 
 ```json
 {
-  "package": "@codespaces/ssh"
+  "package": "@ebowwa/ssh"
 }
 ```
 
@@ -104,10 +106,10 @@ Add to your MCP config:
 dependency_graph(format="mermaid")
 ```
 
-### What depends on `@codespaces/ssh`?
+### What depends on `@ebowwa/ssh`?
 
 ```
-impact_analysis(package="@codespaces/ssh", format="tree")
+impact_analysis(package="@ebowwa/ssh", format="tree")
 ```
 
 ### Find circular dependencies

package/bun.lock

@@ -5,6 +5,7 @@
     "": {
       "name": "@ebowwa/dependency-graph-mcp",
       "dependencies": {
+        "@ebowwa/dependency-graph": "^1.0.0",
         "@modelcontextprotocol/sdk": "^1.0.4",
         "zod": "^3.24.1",
       },
@@ -19,6 +20,8 @@
     },
   },
   "packages": {
+    "@ebowwa/dependency-graph": ["@ebowwa/dependency-graph@1.0.1", "", {}, "sha512-CTdY2L+aQdPkdYhbLszh9XxU46AEBu3bIWtfif23xurGJ9g1jxwhPEy/4TSgW2R0dmyalen0Iq62fjgLzeSeAg=="],
+
     "@hono/node-server": ["@hono/node-server@1.19.9", "", { "peerDependencies": { "hono": "^4" } }, "sha512-vHL6w3ecZsky+8P5MD+eFfaGTyCeOHUIFYMGpQGbrBTSmNNoxv0if69rEZ5giu36weC5saFuznL411gRX7bJDw=="],
 
     "@modelcontextprotocol/sdk": ["@modelcontextprotocol/sdk@1.26.0", "", { "dependencies": { "@hono/node-server": "^1.19.9", "ajv": "^8.17.1", "ajv-formats": "^3.0.1", "content-type": "^1.0.5", "cors": "^2.8.5", "cross-spawn": "^7.0.5", "eventsource": "^3.0.2", "eventsource-parser": "^3.0.0", "express": "^5.2.1", "express-rate-limit": "^8.2.1", "hono": "^4.11.4", "jose": "^6.1.3", "json-schema-typed": "^8.0.2", "pkce-challenge": "^5.0.0", "raw-body": "^3.0.0", "zod": "^3.25 || ^4.0", "zod-to-json-schema": "^3.25.1" }, "peerDependencies": { "@cfworker/json-schema": "^4.1.1" }, "optionalPeers": ["@cfworker/json-schema"] }, "sha512-Y5RmPncpiDtTXDbLKswIJzTqu2hyBKxTNsgKqKclDbhIgg1wgtf1fRuvxgTnRfcnxtvvgbIEcqUOzZrJ6iSReg=="],

package/dist/index.js

@@ -13267,11 +13267,9 @@ var ServerResultSchema2 = union([
   CreateTaskResultSchema2
 ]);
 
-// src/index.ts
-import { readdirSync, readFileSync, existsSync } from "fs";
-import { join, dirname, relative } from "path";
-import { fileURLToPath } from "url";
-var TOOLING_DIR = dirname(fileURLToPath(import.meta.url.replace("/MCP/packages/dependency-graph", "/packages/src/tooling")));
+// ../../src/dependency-graph/dist/builder.js
+import { readdirSync, readFileSync, existsSync } from "node:fs";
+import { join, dirname, relative } from "node:path";
 
 class DependencyGraphBuilder {
   monorepoRoot;
@@ -13461,105 +13459,111 @@ class DependencyGraphBuilder {
   getGraph() {
     return this.graph;
   }
+  getMonorepoRoot() {
+    return this.monorepoRoot;
+  }
 }
-var DEPENDENCY_GRAPH_SCHEMA = {
-  name: "dependency_graph",
-  description: "Build a complete dependency graph of the monorepo",
-  inputSchema: {
-    type: "object",
-    properties: {
-      includeDevDependencies: {
-        type: "boolean",
-        description: "Include devDependencies in the graph",
-        default: false
-      },
-      analyzeImports: {
-        type: "boolean",
-        description: "Analyze TypeScript/JavaScript imports",
-        default: true
-      },
-      excludePatterns: {
-        type: "array",
-        items: { type: "string" },
-        description: "Regex patterns to exclude from dependency analysis",
-        default: []
-      },
-      format: {
-        type: "string",
-        enum: ["json", "mermaid", "dot", "tree"],
-        description: "Output format for the graph",
-        default: "json"
+// ../../src/dependency-graph/dist/analysis.js
+function findCircularDependencies(graph, maxDepth = 10) {
+  const cycles = [];
+  const visited = new Set;
+  const recursionStack = new Set;
+  function dfs(node, path) {
+    if (path.length > maxDepth)
+      return;
+    visited.add(node);
+    recursionStack.add(node);
+    path.push(node);
+    for (const edge of graph.edges) {
+      if (edge.from === node) {
+        if (recursionStack.has(edge.to)) {
+          const cycleStart = path.indexOf(edge.to);
+          if (cycleStart >= 0) {
+            cycles.push([...path.slice(cycleStart), edge.to]);
+          }
+        } else if (!visited.has(edge.to)) {
+          dfs(edge.to, [...path]);
+        }
       }
     }
+    recursionStack.delete(node);
   }
-};
-var IMPACT_ANALYSIS_SCHEMA = {
-  name: "impact_analysis",
-  description: "Analyze the impact of changing a specific package",
-  inputSchema: {
-    type: "object",
-    properties: {
-      package: {
-        type: "string",
-        description: "Package name to analyze"
-      },
-      includeTransitive: {
-        type: "boolean",
-        description: "Include transitive dependents",
-        default: true
-      },
-      format: {
-        type: "string",
-        enum: ["json", "tree"],
-        description: "Output format",
-        default: "tree"
-      }
-    },
-    required: ["package"]
+  for (const [name, node] of graph.nodes) {
+    if (node.type === "workspace" && !visited.has(name)) {
+      dfs(name, []);
+    }
   }
-};
-var FIND_CIRCULAR_SCHEMA = {
-  name: "find_circular",
-  description: "Find circular dependencies in the monorepo",
-  inputSchema: {
-    type: "object",
-    properties: {
-      maxDepth: {
-        type: "number",
-        description: "Maximum depth to search for cycles",
-        default: 10
-      }
+  return cycles;
+}
+function analyzeImpact(graph, packageName, includeTransitive = true) {
+  const direct = [];
+  const transitive = [];
+  const visited = new Set;
+  const directDependents = graph.reverseEdges.get(packageName);
+  if (directDependents) {
+    for (const dep of directDependents) {
+      direct.push(dep);
+      visited.add(dep);
     }
   }
-};
-var UNUSED_CODE_SCHEMA = {
-  name: "unused_code",
-  description: "Find potentially unused packages (no dependents)",
-  inputSchema: {
-    type: "object",
-    properties: {
-      includeExternal: {
-        type: "boolean",
-        description: "Include external dependencies",
-        default: false
-      }
+  if (includeTransitive) {
+    for (const dep of direct) {
+      collectTransitive(graph, dep, visited, transitive);
     }
   }
-};
-var PACKAGE_INFO_SCHEMA = {
-  name: "package_info",
-  description: "Get detailed information about a specific package",
-  inputSchema: {
-    type: "object",
-    properties: {
-      package: {
-        type: "string",
-        description: "Package name"
+  return {
+    direct,
+    transitive,
+    all: Array.from(visited)
+  };
+}
+function collectTransitive(graph, packageName, visited, result) {
+  const dependents = graph.reverseEdges.get(packageName);
+  if (!dependents)
+    return;
+  for (const dep of dependents) {
+    if (!visited.has(dep)) {
+      visited.add(dep);
+      result.push(dep);
+      collectTransitive(graph, dep, visited, result);
+    }
+  }
+}
+function findUnusedPackages(graph, includeExternal = false) {
+  const unused = [];
+  for (const [name, node] of graph.nodes) {
+    if (node.type === "workspace" || includeExternal) {
+      const dependents = graph.reverseEdges.get(name);
+      if (!dependents || dependents.size === 0) {
+        unused.push(name);
       }
-    },
-    required: ["package"]
+    }
   }
-};
+  return unused;
+}
+function getPackageInfo(graph, packageName) {
+  const node = graph.nodes.get(packageName);
+  if (!node)
+    return null;
+  const dependencies = graph.edges.filter((e) => e.from === packageName).map((edge) => {
+    const depNode = graph.nodes.get(edge.to);
+    return {
+      name: edge.to,
+      type: edge.type,
+      version: depNode?.version
+    };
+  });
+  const dependents = Array.from(graph.reverseEdges.get(packageName) || []);
+  return {
+    name: packageName,
+    type: node.type,
+    path: node.path || "N/A",
+    version: node.version,
+    dependencies,
+    dependents
+  };
+}
+// ../../src/dependency-graph/dist/formatters.js
 function formatGraph(graph, format) {
   switch (format) {
     case "mermaid":
@@ -13570,21 +13574,24 @@ function formatGraph(graph, format) {
       return formatAsTree(graph);
     case "json":
     default:
-      return JSON.stringify({
-        nodes: Array.from(graph.nodes.values()),
-        edges: graph.edges
-      }, null, 2);
+      return formatAsJson(graph);
   }
 }
+function formatAsJson(graph) {
+  return JSON.stringify({
+    nodes: Array.from(graph.nodes.values()),
+    edges: graph.edges
+  }, null, 2);
+}
 function formatAsMermaid(graph) {
   const lines = ["graph TD"];
   for (const [name, node] of graph.nodes) {
     const label = node.type === "workspace" ? `\uD83D\uDCE6 ${name}` : `\uD83D\uDCDA ${name}`;
-    lines.push(`  ${name.replace(/[^a-zA-Z0-9]/g, "_")}["${label}"]`);
+    lines.push(`  ${sanitizeId(name)}["${label}"]`);
   }
   for (const edge of graph.edges) {
-    const from = edge.from.replace(/[^a-zA-Z0-9]/g, "_");
-    const to = edge.to.replace(/[^a-zA-Z0-9]/g, "_");
+    const from = sanitizeId(edge.from);
+    const to = sanitizeId(edge.to);
     const label = edge.type === "workspace" ? "workspace" : edge.type === "import" ? "imports" : "external";
     lines.push(`  ${from} -->|${label}| ${to}`);
   }
@@ -13592,7 +13599,7 @@ function formatAsMermaid(graph) {
   lines.push("  classDef external fill:#f5f5f5");
   lines.push("  classDef import fill:#fff3e0");
   for (const [name, node] of graph.nodes) {
-    const id = name.replace(/[^a-zA-Z0-9]/g, "_");
+    const id = sanitizeId(name);
     if (node.type === "workspace") {
       lines.push(`  class ${id} workspace`);
     } else if (node.type === "external") {
@@ -13651,8 +13658,8 @@ function printTree(graph, nodeName, prefix, seen, lines) {
   for (let i = 0;i < outgoing.length; i++) {
     const edge = outgoing[i];
     const isLast = i === outgoing.length - 1;
-    const connector = isLast ? "\u2514\u2500\u2500" : "\u251C\u2500\u2500";
-    const childPrefix = prefix + (isLast ? "    " : "\u2502   ");
+    const connector = isLast ? "└──" : "├──";
+    const childPrefix = prefix + (isLast ? "    " : "│   ");
     lines.push(`${prefix}${connector} \uD83D\uDCE6 ${edge.to} [${edge.type}]`);
     if (!seen.has(edge.to)) {
       printTree(graph, edge.to, childPrefix, seen, lines);
@@ -13660,77 +13667,114 @@ function printTree(graph, nodeName, prefix, seen, lines) {
   }
   const externals = graph.edges.filter((e) => e.from === nodeName && graph.nodes.get(e.to)?.type === "external");
   if (externals.length > 0) {
-    lines.push(`${prefix}\u2514\u2500\u2500 \uD83D\uDCDA ${externals.length} external dependencies`);
+    lines.push(`${prefix}└── \uD83D\uDCDA ${externals.length} external dependencies`);
   }
 }
-function findCircularDependencies(graph, maxDepth = 10) {
-  const cycles = [];
-  const visited = new Set;
-  const recursionStack = new Set;
-  function dfs(node, path) {
-    if (path.length > maxDepth)
-      return;
-    visited.add(node);
-    recursionStack.add(node);
-    path.push(node);
-    for (const edge of graph.edges) {
-      if (edge.from === node) {
-        if (recursionStack.has(edge.to)) {
-          const cycleStart = path.indexOf(edge.to);
-          if (cycleStart >= 0) {
-            cycles.push([...path.slice(cycleStart), edge.to]);
-          }
-        } else if (!visited.has(edge.to)) {
-          dfs(edge.to, [...path]);
-        }
+function sanitizeId(name) {
+  return name.replace(/[^a-zA-Z0-9]/g, "_");
+}
+// src/index.ts
+var DEPENDENCY_GRAPH_SCHEMA = {
+  name: "dependency_graph",
+  description: "Build a complete dependency graph of the monorepo",
+  inputSchema: {
+    type: "object",
+    properties: {
+      includeDevDependencies: {
+        type: "boolean",
+        description: "Include devDependencies in the graph",
+        default: false
+      },
+      analyzeImports: {
+        type: "boolean",
+        description: "Analyze TypeScript/JavaScript imports",
+        default: true
+      },
+      excludePatterns: {
+        type: "array",
+        items: { type: "string" },
+        description: "Regex patterns to exclude from dependency analysis",
+        default: []
+      },
+      format: {
+        type: "string",
+        enum: ["json", "mermaid", "dot", "tree"],
+        description: "Output format for the graph",
+        default: "json"
       }
     }
-    recursionStack.delete(node);
   }
-  for (const [name, node] of graph.nodes) {
-    if (node.type === "workspace" && !visited.has(name)) {
-      dfs(name, []);
-    }
+};
+var IMPACT_ANALYSIS_SCHEMA = {
+  name: "impact_analysis",
+  description: "Analyze the impact of changing a specific package",
+  inputSchema: {
+    type: "object",
+    properties: {
+      package: {
+        type: "string",
+        description: "Package name to analyze"
+      },
+      includeTransitive: {
+        type: "boolean",
+        description: "Include transitive dependents",
+        default: true
+      },
+      format: {
+        type: "string",
+        enum: ["json", "tree"],
+        description: "Output format",
+        default: "tree"
+      }
+    },
+    required: ["package"]
   }
-  return cycles;
-}
-function analyzeImpact(graph, packageName, includeTransitive = true) {
-  const direct = [];
-  const transitive = [];
-  const visited = new Set;
-  const directDependents = graph.reverseEdges.get(packageName);
-  if (directDependents) {
-    for (const dep of directDependents) {
-      direct.push(dep);
-      visited.add(dep);
+};
+var FIND_CIRCULAR_SCHEMA = {
+  name: "find_circular",
+  description: "Find circular dependencies in the monorepo",
+  inputSchema: {
+    type: "object",
+    properties: {
+      maxDepth: {
+        type: "number",
+        description: "Maximum depth to search for cycles",
+        default: 10
+      }
     }
   }
-  if (includeTransitive) {
-    for (const dep of direct) {
-      collectTransitive(graph, dep, visited, transitive);
+};
+var UNUSED_CODE_SCHEMA = {
+  name: "unused_code",
+  description: "Find potentially unused packages (no dependents)",
+  inputSchema: {
+    type: "object",
+    properties: {
+      includeExternal: {
+        type: "boolean",
+        description: "Include external dependencies",
+        default: false
+      }
     }
   }
-  return {
-    direct,
-    transitive,
-    all: Array.from(visited)
-  };
-}
-function collectTransitive(graph, packageName, visited, result) {
-  const dependents = graph.reverseEdges.get(packageName);
-  if (!dependents)
-    return;
-  for (const dep of dependents) {
-    if (!visited.has(dep)) {
-      visited.add(dep);
-      result.push(dep);
-      collectTransitive(graph, dep, visited, result);
-    }
+};
+var PACKAGE_INFO_SCHEMA = {
+  name: "package_info",
+  description: "Get detailed information about a specific package",
+  inputSchema: {
+    type: "object",
+    properties: {
+      package: {
+        type: "string",
+        description: "Package name"
+      }
+    },
+    required: ["package"]
   }
-}
+};
 var server = new Server({
-  name: "@mcp/dependency-graph",
-  version: "0.1.0"
+  name: "@ebowwa/dependency-graph-mcp",
+  version: "1.0.1"
 }, {
   capabilities: {
     tools: {}
@@ -13766,7 +13810,11 @@ server.setRequestHandler(CallToolRequestSchema2, async (request) => {
           excludePatterns = [],
           format = "json"
         } = args;
-        await cachedBuilder.build({ includeDevDependencies, analyzeImports, excludePatterns });
+        await cachedBuilder.build({
+          includeDevDependencies,
+          analyzeImports,
+          excludePatterns
+        });
         const graph = cachedBuilder.getGraph();
         cachedGraph = graph;
         return {
@@ -13820,15 +13868,7 @@ Total affected: ${impact.all.length} packages`);
       }
       case "unused_code": {
         const { includeExternal = false } = args;
-        const unused = [];
-        for (const [name2, node] of cachedGraph.nodes) {
-          if (node.type === "workspace" || includeExternal) {
-            const dependents = cachedGraph.reverseEdges.get(name2);
-            if (!dependents || dependents.size === 0) {
-              unused.push(name2);
-            }
-          }
-        }
+        const unused = findUnusedPackages(cachedGraph, includeExternal);
         if (unused.length === 0) {
           return {
             content: [{ type: "text", text: "No unused packages found!" }]
@@ -13848,28 +13888,30 @@ ${unused.map((n) => `  \u2514\u2500\u2500 ${n}`).join(`
       }
       case "package_info": {
         const { package: packageName } = args;
-        const node = cachedGraph.nodes.get(packageName);
-        if (!node) {
+        const info = getPackageInfo(cachedGraph, packageName);
+        if (!info) {
           return {
-            content: [{ type: "text", text: `Package "${packageName}" not found in dependency graph.` }]
+            content: [
+              {
+                type: "text",
+                text: `Package "${packageName}" not found in dependency graph.`
+              }
+            ]
           };
         }
-        const dependencies = cachedGraph.edges.filter((e) => e.from === packageName);
-        const dependents = Array.from(cachedGraph.reverseEdges.get(packageName) || []);
         const lines = [
-          `Package: ${packageName}`,
-          `Type: ${node.type}`,
-          `Path: ${node.path || "N/A"}`,
-          node.version ? `Version: ${node.version}` : "",
+          `Package: ${info.name}`,
+          `Type: ${info.type}`,
+          `Path: ${info.path}`,
+          info.version ? `Version: ${info.version}` : "",
           "",
-          `Dependencies (${dependencies.length}):`
+          `Dependencies (${info.dependencies.length}):`
         ];
-        for (const dep of dependencies) {
-          const depNode = cachedGraph.nodes.get(dep.to);
-          lines.push(`  \u2514\u2500\u2500 ${dep.to} [${dep.type}]${depNode?.version ? ` @ ${depNode.version}` : ""}`);
+        for (const dep of info.dependencies) {
+          lines.push(`  \u2514\u2500\u2500 ${dep.name} [${dep.type}]${dep.version ? ` @ ${dep.version}` : ""}`);
         }
-        lines.push(``, `Dependents (${dependents.length}):`);
-        for (const dep of dependents) {
+        lines.push(``, `Dependents (${info.dependents.length}):`);
+        for (const dep of info.dependents) {
           lines.push(`  \u2514\u2500\u2500 ${dep}`);
         }
         return { content: [{ type: "text", text: lines.join(`
@@ -13880,7 +13922,12 @@ ${unused.map((n) => `  \u2514\u2500\u2500 ${n}`).join(`
     }
   } catch (error2) {
     return {
-      content: [{ type: "text", text: `Error: ${error2 instanceof Error ? error2.message : String(error2)}` }],
+      content: [
+        {
+          type: "text",
+          text: `Error: ${error2 instanceof Error ? error2.message : String(error2)}`
+        }
+      ],
       isError: true
     };
   }
@@ -13899,7 +13946,7 @@ async function main() {
   });
   const transport = new StdioServerTransport;
   await server.connect(transport);
-  console.error("[MCP] @mcp/dependency-graph server running on stdio");
+  console.error("[MCP] @ebowwa/dependency-graph-mcp server running on stdio");
   process.stdin.resume();
 }
 main().catch((error2) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ebowwa/dependency-graph-mcp",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "description": "MCP server for dependency graph analysis and visualization in monorepos",
   "type": "module",
   "main": "dist/index.js",
@@ -14,6 +14,7 @@
     "mcp-dev": "MCP_DEV=true bun run src/index.ts"
   },
   "dependencies": {
+    "@ebowwa/dependency-graph": "^1.0.0",
     "@modelcontextprotocol/sdk": "^1.0.4",
     "zod": "^3.24.1"
   },