From a Feasible to a Basic Feasible Flow Vector) Consider a feasible minimum cost flow problem such that the corresponding graph is connected. Suppose we are given a feasible flow vector x. Construct an algorithm that suitably modifies x to obtain a basic feasible flow vector and an associated spanning tree
