Time Complexity of Ford-Fulkerson method when dividing capacities and flows by an integer

后端 未结 0 1670
一个人的身影
一个人的身影 2020-12-02 12:46

Consider a flow network G with integer capacities, and divide every capacity by some integer value x. Since the time complexity of Ford-Fulkerson is O(f * |E|), would this

相关标签:
回答
  • 消灭零回复
提交回复
热议问题