Module path 

Shortcut path unpacking — node-path reconstruction after a CCH query.

Ported from native/routing-core/src/cch_mmap.rs in rapidonkey (path_query → node_path; unpack_arc; find_up_arc; Dir).

The algorithm is a bidirectional elimination-tree search that records predecessors in both the forward and backward sweeps, selects the meeting node exactly as routingkit does (strict < update along the backward ancestor walk), and then recursively unpacks each shortcut arc via a merge-join over the lower-triangle down-neighbour lists — choosing the FIRST witness, matching routingkit’s unpack_forward_arc / unpack_backward_arc.

Structs

PathQuery

Reusable, buffer-recycling node-path query against a single CCH.

Functions

node_path

Shortest-path node sequence in ORIGINAL dense node ids, source first, target last. Returns None if target is unreachable from source. Self-pair (source == target) returns Some(vec![source]).