pub fn why<F: Fs>(db: &GraphDb<F>, a: &str, b: &str) -> WhyReportExpand description
Why a and b are linked.
Deterministic: links come back in the engine’s (rule, edge type) order,
evidence is sorted before it is cut, and the path — when there is one — is
the same shortest walk every time.