Consider the shortest path problems shown in Figure 5.10. Check whether or not the distance label d(j) given next to each node j represents me length of some path. If your answer is yes for every node, list all the arcs that do not satisfy the shortest path optimality conditions.
