Edmond-Karp or Dinic for max flow?

Правка en1, от bluescorp, 2021-05-23 19:22:02

I just read the Ford-Fulkerson algorithm and Edmond-Karp's and Dinic's optimization on it. Should I always use Dinic for a max flow question or is Edmond Karp good enough for most of the questions? Asking this cos Edmond Karp looks relatively easy to code.

Теги #network flow, edmond-karp, #dinic

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский bluescorp 2021-05-23 19:22:02 290 Initial revision (published)