FF algorithm doesn't specify how to find a path from s to t.
Should we explain how we implement this part of the algorithm when we analyze the time complexity?
Date: 17 Jan 2015 10:07
Number of posts: 3
RSS: New posts
The only thing FF assumes is that it won't take you more than O(|E|) to find a path. This is reasonable, since you can use, for example, DFS. There is no need to analyze it further, as FF is a generic algorithm, WITHOUT an implementation of finding a path.