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?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.