A&DS S04E04. Flows. Dinic's algorithm

2,662 views

About this video

Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: Any recommendations of youtube channels for programming and computer science stuff? · 82% confidence

Derives Dinic's max-flow algorithm (BFS level graphs, blocking flows found with DFS) and proves its O(V²E) bound, continuing directly from the Ford–Fulkerson lecture.

Dinic's max-flow algorithm: level graphs, blocking flows and complexity analysis.

Video by Pavel Mavrin, played through YouTube's embedded player.

Part of A&DS English Course