In Maude’s shortest path problem, suppose all arcs in the network are “double-arrowed,” that is, Maude can travel along each arc (with the same distance) in either direction. Modify the spreadsheet...

In Maude’s shortest path problem, suppose all arcs in the network are “double-arrowed,” that is, Maude can travel along each arc (with the same distance) in either direction. Modify the spreadsheet model appropriately. Is her optimal solution still the same?