Abstract
For sloving the unimodular min cost potential problem a primal algorithm using basic solutions is presented. The efficiency of the procedure is based on an effective way of transformation of the set of basic cycles and basic cocycles.
The case of degeneracy is solved by introducing one additive vector of restrictions.