(Shortest Path Problems with Negative Cycles) Consider the problem of finding a simple forward path between an origin and a destination node that has minimum length. Show that even if there are negative cycles, the problem can be formulated as a minimum cost flow problem involving node throughput constraints of the form
