Content deleted Content added
→Should BreadthFirstSearch take F as a parameter?: new section |
→Fatest pipe heuristic: new section |
||
Line 74:
Damix [[Special:Contributions/217.202.48.196|217.202.48.196]] ([[User talk:217.202.48.196|talk]]) 23:42, 10 September 2011 (UTC)
== Fatest pipe heuristic ==
Edmonds Karp is sometimes implemented using fatest path instead of shortest path. This has a runtime of O(|E|^2*logC) with C being the max flow. (for sparse graphs it's O(|E|logC*(|E|+|V|log|V|)) using Dijkstra).
I guess |V| rarely much larger than logC, but perhaps the variation should be mentioned for completeness?
| |||