Discuss the running time of ford-fulkerson algorithm
Answers
Answered by
1
The time complexity of the Ford-Fulkerson Algorithm is O((m+n)*C) where C is the maximum capacity of the flow (the f in Miguel Oliveira's answer). O(m+n) is the running time of Breadth First Search which is used to find the augmenting paths.
***********************************************************
PLEASE MARK AS Brainliest Answer
***********************************************************
PLEASE MARK AS Brainliest Answer
Similar questions