Struct HybridStore 

pub struct HybridStore { /* private fields */ }

Executes hybrid graph + vector queries.

Implementations

impl HybridStore

pub fn query( &self, q: HybridQuery<'_>, col: &Collection, ) -> Result<Vec<HybridResult>>

Run a hybrid graph + vector query.

The algorithm proceeds in three stages:

1. Graph traversal — walks the memory graph from q.anchor_node up to q.graph_depth hops, recording the maximum edge weight seen for each reachable node.
2. Vector search — retrieves the top q.top_k × 20 approximate nearest neighbours from the named collection.
3. Score blending — for each candidate, computes rank = q.alpha × vec_similarity + (1 − q.alpha) × graph_weight, then returns the top q.top_k results sorted by rank descending.