let g be a digraph and let a, b, c ∈ v(g). prove that dist(a, c) = dist(a, b) dist(b, c) iff b is on a shortest path from a to c.