Software engineering of the flow algorithms

The authors consider the ways of the software engineering of the pivot procedures in the scheme of the primal simplex algorithm for flow problems, which enable to rearrange the redix tree within the linear time of the vortex of network number, considerably decrease the number of checks of the optimality condition. The technique of the software implementation of these procedures is given in the source text of the abstract class transport and classes Transshipment and Transportation which are destined for solving and post-organizational analysis of the transportation problems in the cross network and matrix definitions respectively.