In Maude’s shortest path problem, suppose all arcs in the current network from higher-numbered nodes

In Maude’s shortest path problem, suppose all arcs in the
current network from higher-numbered nodes to lower-numbered nodes, such as
from node 6 to node 5, are disallowed. Modify the spreadsheet model and find
the shortest path from node 1 to node 10. Is it the same as before? Should you
have known the answer to this question before making any changes to the
original model? Explain.