All geek questions in one place

How to apply the Ford-Fulkerson algorithm to a graph to find the maximum stream in a streaming network?

Can someone direct me to a site where step-by-step instructions are given on how to apply the ford-fulkerson method on a chart to find the maximum flow.

Thank you so much in advance.

+3
source share
3 answers

The best I know ( link ), wikipedia ( link ) and Google’s first alternative hit ( Link ).

Ford-Fulkerson Labeling Algorithm

  • (Initialization) Let x be the initial admissible flow (for example, x (e) = 0 for all e in E).
  • ( ) s t , . . p, x as 2.
    • x (e) = x (e) + delta, e - p.
    • x (e) = x (e) -delta, e - p. . .

: Java

+3

Source: https://habr.com/ru/post/1772929/

More articles:


All Articles