Ford Fulkerson
Ford Fulkerson. Ford-Fulkerson ( N =( G, c, s, t )) ; G = ( V , E ) for each edge , while exists a path P from s to t in residual network N f do for each edge do return f. דוגמא:. 12. v1. v2. 20. 16. 9. t. 4. 10. s.
287 views • 12 slides