Find Edges in Shortest Paths
An edge lies on a shortest path when its distance from node 0 plus its weight plus its distance to the last node equals the shortest total.
An edge lies on a shortest path when its distance from node 0 plus its weight plus its distance to the last node equals the shortest total.