Function s_path 

pub fn s_path(
    ix: &InfonIndex<RoarPostings>,
    a: &str,
    b: &str,
    s: usize,
    noise: &HashSet<String>,
) -> Value

Shortest ≥s-overlap path (fewest hops) between two tokens over the structural graph; null if disconnected at s.