trace
Follow code across service boundaries by tracing a feature end-to-end or finding the shortest path between nodes, each hop labeled with its mechanism.
Instructions
Follow the code across boundaries. One argument: trace a feature end-to-end — the ordered path from entry through the stack, each hop labelled with its mechanism (call / HTTP / queue / event / data), crossing service boundaries (frontend→backend). Two arguments: the shortest path between two specific nodes, hop by hop. This is where the graph beats reading many files — it knows the cross-stack links grep can't see.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| depth | No | Max hops for the cross-stack feature trace. Default 6. | |
| budget | No | Max chars in the result. 0 = no cap. | |
| to_node | No | Optional target node. Given → shortest path from_node→to_node. Blank → trace `from_node` as a feature across the stack. | |
| from_node | Yes | A feature/keyword to trace end-to-end (one arg), OR the start node when tracing a path to `to_node`. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |