Expand description
Tree Walker — Best-First Search over document trees.
Core algorithm (ported from Python tree_searcher.py):
- Anchor Retrieval: use host-provided scores to find high-value entry nodes
- Tree Walk: BFS expansion from anchors along parent/child/sibling edges
- Path Aggregation: select best root-to-leaf paths as results
Structs§
- Flat
Node - Flat node from tree walker reranking.
- Path
Node - Path
Result - A scored root-to-answer path.
- Search
State - State in the Best-First Search frontier.
- Tree
Searcher - Tree searcher engine.