Network flows question. Please write down your own words.Don't copy other resources. Thanks

Suppose that a minimum cost flow problem contains both arcs (r', j) and (j. i) for some pair of nodes. Transform this problem to One in which the network contains either are {Lj} or arc (j, i), but not both