Dinic algorithm
Edmonds-Karp (EK) algorithm :
Each path will conduct a search for a path through the bfs, Dinic is to optimize the number of bfs.
Ford-Fulkerson (FF) algorithm :
O (n × m × m), more NA side case.
Optimized on this basis had Dinic algorithm.
Dinic time complexity : Each run again bfs, again dfs, the worst case is O (n × n × m) .
Since the number of edges generally m≥n, so a × m, a × n,