“…In [9], the productivity of the maximum flow, determined using the Ford-Fulkerson algorithm on grid and random geometric graphs, was studied. In [7], combinatorial structures for weighted graphs with a low field volume were studied by the same method.…”