Graph Commands

codeknit provides graph commands to visualize structure, run automated analysis, and combine the current dependency graph with Git change history.

graph show

Generates an interactive HTML graph visualization of your codebase.

codeknit graph show <input-path>

This command parses your codebase and produces a self-contained HTML file with an interactive graph visualization. Symbols (functions, classes, types) appear as nodes, and their relationships (calls, contains, implements) as edges. The visualization opens automatically in your default browser.

The viewer draws resolved relationships. It displays an uncertainty count but does not draw individual unresolved or ambiguous relationships or their candidate links. Inspect those relationships with parse output:

codeknit parse ./src --output-mode inline --edges
codeknit parse ./src --output-mode inline --format json --edges

Flags

Flag	Default	Description
-o, --output	./skeleton/codeknit-graph.html	Output HTML file path
--collect-test	false	Include test files in analysis
--workers	NumCPU	Max concurrent parsing goroutines
--verbose	false	Print progress information during processing

Examples

# Generate default visualization
codeknit graph show ./myproject

# Custom output file
codeknit graph show ./myproject -o graph.html

# Include test files
codeknit graph show ./src --collect-test

graph analyze

Runs structural graph algorithms on your codebase and emits an LLM-readable .skt report containing code quality insights.

codeknit graph analyze <input-path>

This command reports candidates for review, including cyclic dependencies, hub symbols, dead code, god classes, and architectural bottlenecks.

Algorithms

The analysis includes 22 structural graph algorithms:

• Cyclic dependencies (Tarjan’s SCC)
• Hub detection (high fan-in/fan-out coupling)
• Orphan detection (dead code candidates)
• God class/function detection (excessive children)
• Instability metric (Robert C. Martin’s Ce/(Ca+Ce))
• Deep inheritance chains
• Betweenness centrality (bottleneck detection)
• Articulation points (single points of failure)
• PageRank (recursive importance)
• Transitive fan-in (blast radius)
• Change propagation simulation
• Circular package dependencies
• Layer violation detection
• Reachability from entry points
• Weakly connected components
• Dependency weight (package coupling strength)
• Distance from Main Sequence (A+I balance)
• Shotgun surgery detection
• Feature envy detection
• Stable dependency violations
• Interface segregation violations
• Containment depth

Interpreting the report

Dependency metrics use resolved relationships. The report counts excluded unresolved and ambiguous relationships. File/include metadata is excluded from dependency rankings and dead-code findings.

• Fan-in and fan-out count distinct neighbors. Repeated relationships do not inflate these counts, and containment is not a dependency.
• Inheritance depth considers all bases and interfaces. Cyclic hierarchies are not assigned a depth.
• Reachability starts from callables named main, Main, or init and follows dependency edges. Reaching a member makes its container relevant without marking every sibling reachable. Without a recognized entry point, reachability findings are omitted.
• Callback arguments and returned callables are references, not proof that the callback executes.
• Change propagation uses the strongest dependency path. Its scores and directory-based layer rules are heuristics, not measured probabilities.

External callers, dynamic dispatch, and dependencies outside the scan can change the conclusions. See Language Support and API Fidelity for resolution rules and limits.

Flags

Flag	Default	Description
-o, --output	./skeleton/graph_analysis.skt	Output .skt file path
--collect-test	false	Include test files in analysis
--workers	NumCPU	Max concurrent parsing goroutines
--verbose	false	Print progress information during processing
--fan-threshold	10	Minimum fan-in or fan-out to flag a hub symbol
--god-threshold	15	Minimum contains-edge count to flag a god class/function
--max-inheritance-depth	5	Flag inheritance chains deeper than this
--top-n	30	Cap ranked output sections; 0 = no limit
--betweenness-threshold	0.001	Minimum betweenness centrality value to report
--propagation-cutoff	0.05	Minimum heuristic score to continue change propagation

Examples

# Run structural analysis with defaults
codeknit graph analyze ./myproject

# Custom output and thresholds
codeknit graph analyze ./myproject -o analysis.skt --fan-threshold 15

# Show more results per section
codeknit graph analyze ./myproject --top-n 50

# Remove the cap on ranked sections
codeknit graph analyze ./myproject --top-n 0

# Include test files
codeknit graph analyze ./src --collect-test

graph hotspots

Ranks files that are both frequently changed and structurally important:

codeknit graph hotspots <input-path>

The score combines commit frequency, line churn, and recency with file-level PageRank, transitive fan-in, and betweenness centrality. The report also identifies temporal coupling between files that repeatedly change in the same commits.

Merge commits are excluded by default. Commits changing more than 50 files are also excluded so generated, vendored, or mechanical bulk changes do not distort the results.

Flags

Flag	Default	Description
-o, --output	./skeleton/hotspots.skt	Output file path
--format	skt	Output format: skt or json
--since	12mo	History window, such as 180d, 12mo, or 2y
--max-commits	2000	Maximum commits to inspect
--max-files-per-commit	50	Exclude commits changing more files
--min-cochanges	3	Minimum shared commits for temporal coupling
--top-n	30	Maximum results per report section
--include-merges	false	Include merge commits
--collect-test	false	Include test files
--workers	NumCPU	Maximum concurrent parsing goroutines
--verbose	false	Print progress information

Examples

# Analyze the last 12 months
codeknit graph hotspots ./myproject

# Analyze two years and emit JSON
codeknit graph hotspots ./myproject --since 2y --format json -o hotspots.json

# Include larger commits and require stronger coupling
codeknit graph hotspots . --max-files-per-commit 100 --min-cochanges 5