Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O ( | V | 2 | E | ) {\displaystyle O(|V|^{2}|E|)} time and is similar to the Edmonds–Karp algorithm, which runs in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time, in that it uses shortest augmenting paths.
Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O ( | V | 2 | E | ) {\displaystyle O(|V|^{2}|E|)} time and is similar to the Edmonds–Karp algorithm, which runs in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time, in that it uses shortest augmenting paths.
Source: Wikipedia "Dinic's algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky