Skip to main content Module selector Copy item path Source ContinuedValueFn π Continues a fold that an earlier traversal started: it starts from initial and hands the
wrapped function each edgeβs index shifted by offset. HoprGraphPathSelector A lightweight graph-backed path selector. MetricsValueFn π Wraps an EdgeValueFn<f64, W> as a ValueFn whose Value type carries
both the cost and per-path quality aggregates. PathCostWithMetrics π Accumulated path cost and quality aggregates, folded edge-by-edge during DFS. MIDDLE_HOP_SHARE π A relayer may sit past the first position in at most n.div_ceil(MIDDLE_HOP_SHARE) of the n
candidates take_relayer_diverse keeps, while the pool allows it, counted over every position past
the first together: a relayer in the second position of some paths and the third of others costs
as many paths when it dies as one in either alone. SHARE_SEARCHES π How many times search_share searches one first relayerβs continuations at most. compute_paths π Compute candidate paths from src to dest through graph. compute_paths_spread π Candidate paths from src to dest, spread evenly over srcβs first relayers. distinct_first_relayers π Number of distinct first relayers across paths. opt_min π Returns the minimum of two Option<T> values, preferring Some over None. prune_for_consistency Trim the candidate set to lower median latency and minimise variance while
preserving an anonymity floor and relayer diversity in every position. search_share π One first relayerβs continuations for its share of the pool. take_relayer_diverse π Takes n candidates from sorted, preferring not-yet-represented first relayers and bounding
how often any relayer recurs past the first position.