callgraph-mcp 1.4.1 → 1.4.2

package/README.md

@@ -145,7 +145,7 @@ The agent calls `flowmap_find_cycles(workspacePath)`. Each cycle is returned as
 
 > *"I want to delete code safely. Give me every function that is provably unreachable — not called by anything, not an entry point. Include file and line number."*
 
-The agent calls `flowmap_find_orphans(workspacePath)`. This returns every function not reachable from any entry point in the call graph — with file path and line number for each one. These are not "probably unused" — they are graph-theoretically unreachable. Safe to delete. No cross-checking required.
+The agent calls `flowmap_find_orphans(workspacePath)`. This returns every function not reachable from any entry point in the call graph — with file path and line number for each one. 
 
 ---
 
@@ -173,14 +173,6 @@ The agent calls `flowmap_get_callers` for each modified function and `flowmap_ge
 
 ---
 
-### Understand a single file before editing it
-
-> *"What does `src/auth/middleware.ts` export and what does it call?"*
-
-The agent calls `flowmap_analyze_file("/abs/path/to/src/auth/middleware.ts")` to get a precise list of every function, its parameters, return type, and all outgoing calls — without needing to read the file itself.
-
----
-
 ### Agentic code generation with structural guardrails
 
 When an agent is generating new code, it can call `flowmap_analyze_workspace` before and after to verify:
@@ -194,9 +186,9 @@ When an agent is generating new code, it can call `flowmap_analyze_workspace` be
 
 > *"We've been using an AI agent to build this codebase for 3 months. How much logic has it silently duplicated?"*
 
-Agents optimize for the current instruction, not long-term architecture. When a task requires shared logic, the agent rarely stops to ask "does this already exist?" — refactoring requires understanding dependencies and predicting side effects, which is harder than just writing new code that works. So it copies, tweaks slightly, and moves on. It satisfied the step. It made the problem worse.
+Agents optimize for the current instruction, not long-term architecture. It copies, tweaks slightly, and moves on. It satisfied the local goal.
 
-The agent calls `flowmap_find_duplicates(workspacePath)`. Each cluster in the result is a group of functions with different names — often in different components — that call the same set of dependencies. That's the callee-set fingerprint of duplicated business logic. The output names exactly which functions to merge and which file to consolidate them into.
+The agent calls `flowmap_find_duplicates(workspacePath)`. Each cluster in the result is a group of functions with different names — often in different components — that call the same set of dependencies. 
 
 ---
 
@@ -204,9 +196,7 @@ The agent calls `flowmap_find_duplicates(workspacePath)`. Each cluster in the re
 
 > *"The agent has been adding features for weeks. Are there any circular call dependencies I should know about before this becomes a production problem?"*
 
-Agents don't track long-term call structure. When told to wire up a feature quickly, they take the fastest path: call whatever is needed, from wherever is convenient. Over time this creates circular dependencies — `A` calls `B` calls `C` calls `A` — that are invisible until something breaks or hangs at runtime.
-
-The agent calls `flowmap_find_cycles(workspacePath)`. Every cycle is returned with the exact functions involved, their file locations, and the specific edges forming the loop. No guessing about which modules "seem" circular. The result tells you precisely where to break the chain.
+The agent calls `flowmap_find_cycles(workspacePath)`. Every cycle is returned with the exact functions involved.
 
 ---
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "callgraph-mcp",
-  "version": "1.4.1",
+  "version": "1.4.2",
   "description": "MCP server for codebase call-flow analysis. Local, deterministic, language-agnostic. Powered by @codeflow-map/core.",
   "keywords": [
     "mcp",