Finding Maximum Flow of a Flow Network using the Ford-Fulkerson Algorithm by Ihan Dilnath Lelwala Sample Input From => To => Capacity 0 => 1 => 10 ; 0 => 3 => 10 ; 1 => 2 => 4 ; 1 => 3 => 2 ; 1 => 4 => 8 ; 2 => 5 => 10 ; 3 => 4 => 9 ; 4 => 2 => 6; 4 => 5 => 10 Maximum Flow = 19.0