0 votes 0 votes sh!va asked Jul 15, 2016 sh!va 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes A variation of the Ford–Fulkerson algorithm with guaranteed termination and a runtime independent of the maximum flow value is the Edmonds–Karp algorithm, which runs in O ( V E 2 ) {\displaystyle O(VE^{2})} time. so the option (A) O(nm2) jaiganeshcse94 answered Jul 18, 2016 jaiganeshcse94 comment Share Follow See all 2 Comments See all 2 2 Comments reply sh!va commented Jul 18, 2016 reply Follow Share Sir, please provide any good link to understand Ford fulkerson algorithm 0 votes 0 votes jaiganeshcse94 commented Jul 18, 2016 reply Follow Share please check this link for reference : https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm 0 votes 0 votes Please log in or register to add a comment.
time. so the option (A) O(nm2)
