Function greedy_search

pub fn greedy_search(
    graph: &dyn Graph,
    start: OrderedNode,
    dist_calc: &impl DistCalculator,
    prefetch_distance: Option<usize>,
) -> OrderedNode

Greedy search over a graph

This searches for only one result, only used for finding the entry point

Parameters

graph : Graph The graph to search. start : u32 The index starting point. query : &f32 The query vector.

Returns

A (dist, node_id) pair.

WARNING: Internal API, API stability is not guaranteed