In the paper the original algorithm of solution of an applied task of the graph theory on finding of k maximum flows between the two set count's tops is proposed. The approach described represents a complex application of Ford-Fulkerson (Edmonds-Karp or Dinitz) algorithm and the algorithm of creation of a truncated tree of states in width in an indivisible optimizing cycle.
1 - 1 of 1 items