We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
A CLI application written in Java to find Maximum Flow a flow network using the Ford-Fulkerson algorithm.
by Ihan Dilnath Lelwala
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