Sources program, located in the maximum flow graph. Sources presented at 2 languages: C + + and Delphi (Pascal). Search maximum flow method of Ford-Falkersona. Search queue along the way. Graf kept contiguity list. The required memory - 6E +4 V (where E - the number of arcs in box; V - the number tops). The complexity of the algorithm - O (E ^ 2 * V).