https://pizza.rs/tags/traverse/Recent content in Traverse on INFINI PizzaHugoenhttps://pizza.rs/docs/references/search/relational/traverse/Mon, 01 Jan 0001 00:00:00 +0000https://pizza.rs/docs/references/search/relational/traverse/<h1 id="traverse-query"> Traverse query <a class="anchor" href="#traverse-query">#</a> </h1> <p>Term and full-text queries match document <em>content</em>; none of them can ask &ldquo;what is <em>connected</em> to these documents?&rdquo; — the question citation graphs, reference data and knowledge graphs are made of. The traverse query answers it: a bounded graph traversal over a <code>relation</code>-typed edge field — starting from seed documents, walk the edges up to <code>max_depth</code> hops and emit every reached node as a hit.</p> <p>Scores encode distance — <code>1.0 / (1.0 + depth)</code> — so seeds outrank 1-hop neighbors, which outrank 2-hop neighbors, and the standard top-K collector orders the results.</p>