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: --json and --toon are 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: ❌ Problem: Many cycles detected ✅ Solution: This indicates circular dependencies in code. Consider refactoring. ❌ Problem: Missing branches ✅ Solutions: Trace graph result: - Mapping complete function dependencies - Understanding complex code flows - Impact analysis for major refactoring - Visualizing application architecture - Reduce depth: --depth 2 - Trace specific function instead of main - Use --mode fast - Try --mode precise - Check if files are indexed - Verify language is enabled - Start shallow: Begin with --depth 2 , increase as needed - Focus analysis: Trace specific functions, not always main - Export for docs: Use JSON for generating diagrams - Track over time: Monitor node count as complexity metric - Investigate cycles: Circular dependencies are code smells