OverviewHistoryStatsSecurity
npx skills add ...
Documentation
SKILL.md
npx skills add yoanbernabeu/grepai-skills --skill grepai-trace-graph
Build complete call graphs with GrepAI trace. Use this skill for recursive dependency analysis.
npx skills add yoanbernabeu/grepai-skills --skill grepai-trace-graph
This skill covers using grepai trace graph to build complete call graphs showing all dependencies recursively.
grepai trace graph builds a recursive dependency tree:
Output:
Limit recursion depth with --depth:
--depth 1 (same as callees):
--depth 2 (default):
--depth 3:
Output:
Output:
TOON format offers ~50% fewer tokens than JSON:
Note:
--jsonand--toonare mutually exclusive.
GrepAI detects and marks circular dependencies:
In JSON:
For very large codebases, graphs can be overwhelming:
Then render:
Track complexity over time:
❌ Problem: Graph too large / timeout ✅ Solutions:
--depth 2main--mode fast❌ Problem: Many cycles detected ✅ Solution: This indicates circular dependencies in code. Consider refactoring.
❌ Problem: Missing branches ✅ Solutions:
--mode precise--depth 2, increase as neededmainTrace graph result:
grepai trace graph "main"🔍 Call Graph for "main"
main
├── initialize
│ ├── loadConfig
│ └── connectDB
├── startServer
│ ├── registerRoutes
│ └── listen
└── gracefulShutdown
└── closeDB
Nodes: 9
Max depth: 3# Default depth (2 levels)
grepai trace graph "main"
# Deeper analysis (3 levels)
grepai trace graph "main" --depth 3
# Shallow (1 level, same as callees)
grepai trace graph "main" --depth 1
# Very deep (5 levels)
grepai trace graph "main" --depth 5main
├── initialize
├── startServer
└── gracefulShutdownmain
├── initialize
│ ├── loadConfig
│ └── connectDB
├── startServer
│ ├── registerRoutes
│ └── listen
└── gracefulShutdown
└── closeDBgrepai trace graph "main" --depth 2 --json{
"query": "main",
"mode": "graph",
"depth": 2,
"root": {
"name": "main",
"file": "cmd/main.go",
"line": 10,
"children": [
{
"name": "initialize",
"file": "cmd/main.go",
"line": 15,
"children": [
{
"name": "loadConfig",
"file": "config/config.go",
"line": 20,
"children": []
},
{
"name": "connectDB",
"file": "db/db.go",
"line": 30,
"children": []
}
]
},
{
"name": "startServer",
"file": "server/server.go",
"line": 25,
"children": [
{
"name": "registerRoutes",
"file": "server/routes.go",
"line": 10,
"children": []
}
]
}
]
},
"stats": {
"nodes": 6,
"max_depth": 2
}
}grepai trace graph "main" --depth 2 --json --compact{
"q": "main",
"d": 2,
"r": {
"n": "main",
"c": [
{"n": "initialize", "c": [{"n": "loadConfig"}, {"n": "connectDB"}]},
{"n": "startServer", "c": [{"n": "registerRoutes"}]}
]
},
"s": {"nodes": 6, "depth": 2}
}grepai trace graph "main" --depth 2 --toon# Fast mode (regex-based)
grepai trace graph "main" --mode fast
# Precise mode (tree-sitter AST)
grepai trace graph "main" --mode precise# Map entire application startup
grepai trace graph "main" --depth 4# What depends on this utility function?
grepai trace graph "validateInput" --depth 3
# Full impact of changing database layer
grepai trace graph "executeQuery" --depth 2# Is this function too complex?
grepai trace graph "processOrder" --depth 5
# Many nodes = high complexity# Generate architecture diagram data
grepai trace graph "main" --depth 3 --json > architecture.json# What would break if we change this?
grepai trace graph "legacyAuth" --depth 3main
├── processA
│ └── processB
│ └── processA [CYCLE]{
"name": "processA",
"cycle": true
}# Start shallow
grepai trace graph "main" --depth 2# Instead of main, trace specific subsystem
grepai trace graph "authMiddleware" --depth 3# Get JSON and filter
grepai trace graph "main" --depth 3 --json | jq '...'# Convert JSON to DOT
grepai trace graph "main" --depth 3 --json | python3 << 'EOF'
import json
import sys
data = json.load(sys.stdin)
print("digraph G {")
print(" rankdir=TB;")
def traverse(node, parent=None):
name = node.get('name') or node.get('n')
if parent:
print(f' "{parent}" -> "{name}";')
children = node.get('children') or node.get('c') or []
for child in children:
traverse(child, name)
traverse(data.get('root') or data.get('r'))
print("}")
EOFdot -Tpng graph.dot -o graph.pnggrepai trace graph "main" --depth 2 --json | python3 << 'EOF'
import json
import sys
data = json.load(sys.stdin)
print("```mermaid")
print("graph TD")
def traverse(node, parent=None):
name = node.get('name') or node.get('n')
if parent:
print(f" {parent} --> {name}")
children = node.get('children') or node.get('c') or []
for child in children:
traverse(child, name)
traverse(data.get('root') or data.get('r'))
print("```")
EOF# Get node count
grepai trace graph "main" --depth 3 --json | jq '.stats.nodes'
# Compare before/after refactoring
echo "Before: $(grepai trace graph 'main' --depth 3 --json | jq '.stats.nodes') nodes"
# ... refactoring ...
echo "After: $(grepai trace graph 'main' --depth 3 --json | jq '.stats.nodes') nodes"🔍 Call Graph for "main"
Depth: 3
Mode: fast
main
├── initialize
│ ├── loadConfig
│ │ └── parseYAML
│ └── connectDB
│ ├── createPool
│ └── ping
├── startServer
│ ├── registerRoutes
│ │ ├── authMiddleware
│ │ └── loggingMiddleware
│ └── listen
└── gracefulShutdown
└── closeDB
Statistics:
- Total nodes: 12
- Maximum depth reached: 3
- Cycles detected: 0
Tip: Use --json for machine-readable output
Use --depth N to control recursion depth