Editing Ford–Fulkerson algorithm (section)

== References ==
* {{cite book
 | first1 = Thomas H.
 | last1 = Cormen
 | author-link1 = Thomas H. Cormen
 | first2 = Charles E.
 | last2 = Leiserson
 | author-link2 = Charles E. Leiserson
 | first3 = Ronald L.
 | last3 = Rivest
 | author-link3 = Ronald L. Rivest
 | first4 = Clifford
 | last4 = Stein
 | author-link4 = Clifford Stein
 | title = [[Introduction to Algorithms]]
 | edition = Second
 | publisher = MIT Press and McGraw&ndash;Hill
 | year = 2001 
 | isbn = 0-262-03293-7
 | chapter = Section 26.2: The Ford&ndash;Fulkerson method
 | pages = 651&ndash;664
}}
* {{cite book |author1=George T. Heineman |author2=Gary Pollice |author3=Stanley Selkow | title= Algorithms in a Nutshell | publisher=[[Oreilly Media]] | year=2008 | chapter=Chapter 8:Network Flow Algorithms | pages = 226–250 | isbn=978-0-596-51624-6 }}
* {{cite book |author1=Jon Kleinberg  | author-link1 =Jon Kleinberg|author2=Éva Tardos| author-link2 = Éva Tardos|title=Algorithm Design |publisher=Pearson Education |year=2006 |chapter=Chapter 7:Extensions to the Maximum-Flow Problem |pages=[https://archive.org/details/algorithmdesign0000klei/page/378 378–384] |isbn=0-321-29535-8 |chapter-url=https://archive.org/details/algorithmdesign0000klei/page/378 }}
* {{cite book |author=Samuel Gutekunst |title= ENGRI 1101 |publisher= Cornell University | year=2019 }}
*{{cite journal |last1=Backman |first1=Spencer |last2=Huynh |first2=Tony |title=Transfinite Ford–Fulkerson on a finite network |journal=Computability |year=2018 |volume=7 |issue=4 |pages=341–347 |doi=10.3233/COM-180082|arxiv=1504.04363 |s2cid=15497138 }}