pub fn traverse(args_v: &Value, _span: Span) -> Result<Value, Diagnostic>
Topology.traverse — executes zero-heap k-hop or cross-graph cell hop (Graph A -> CellAnchor -> Graph B).
Topology.traverse
Graph A -> CellAnchor -> Graph B