pyshnograev's blog

By pyshnograev, 11 years ago, translation, In English
Quite often come across the problem of finding the maximum flow / minimum cut. In this case, we use the Ford-Fulkerson algorithm, or the Edmonds-Karp, sometimes added to this scale, which significantly speeds up the case. The most difficult part of this problem is its attention to the calculation of the flow.

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it