Edmonds-Karp algorithm is just an implementation of the Ford-Fulkerson method that uses BFS for finding augmenting paths.
Max Flow for the above graph is 150 Source is 0 , Sink is 1 : calculate on your own If you have doubt how feel free to post in discussion of this repo