Expand description
Graph Traversal Algorithms
Provides algorithms for navigating the semantic index:
- BFS backward traversal from target to entry points
- Reference finding
- Path reconstruction
@module trace/traverse
Structs§
- Invocation
Path - A single invocation path from an entry point to a target symbol
- Reference
Context - Reference with full context
- Trace
Result - Result of a trace operation
Functions§
- find_
call_ refs - Find call references to a symbol
- find_
dead_ symbols - Find potentially dead symbols (no incoming references or calls)
- find_
read_ refs - Find read references to a symbol
- find_
refs - Find all references to a symbol
- find_
refs_ of_ kind - Find references of a specific kind
- find_
write_ refs - Find write references to a symbol
- format_
call_ chain - Format a call chain as a string
- format_
invocation_ path - Format an invocation path with file locations
- trace_
symbol - Trace all invocation paths from entry points to a target symbol
- trace_
symbol_ by_ name - Trace a symbol by name