Struct CCHManyToOne 

pub struct CCHManyToOne<'a> { /* private fields */ }

A reusable many-to-one query with a fixed (pinned) set of sources.

The mirror image of CCHOneToMany: pinning precomputes the search space of the sources once; each CCHManyToOne::distances_to call answers distances from all pinned sources to a target in a single sweep.

Thread-safety: Send but not Sync; holds mutable per-query state.

Implementations

impl<'a> CCHManyToOne<'a>

pub fn new(metric: &'a CCHMetric<'a>, sources: &[u32]) -> Self

Create a many-to-one query bound to metric with a fixed set of pinned sources. Distances returned later are aligned with the order of sources (duplicates are allowed and answered per entry).

Panics if any source node id is out of range.

pub fn source_count(&self) -> usize

Number of pinned sources (= length of the distance vectors returned).

pub fn repin_sources(&mut self, sources: &[u32])

Replace the pinned source set, reusing the query’s internal O(n) label buffers (cheaper than constructing a new CCHManyToOne).

Panics if any source node id is out of range.

pub fn distances_to(&mut self, target: u32) -> Vec<Option<u32>>

Compute the shortest distances from every pinned source to target. Result is aligned with the pinned source order; None = unreachable.

pub fn distances_to_multi(&mut self, targets: &[(u32, u32)]) -> Vec<Option<u32>>

Multi-target variant: for each pinned source s, returns min over the given (target, initial_dist) pairs of dist(s, target) + initial_dist.

Panics if targets is empty or contains node ids out of range.