The greedy algorithm for the transportation problem repeatedly picks an edge, maximizes flow on it and updates the supplies and demands. If, with the same order of edges, the greedy algorithm gives an ...