Edmonds Karp Algorithm | Network Flow | Graph Theory

240,355 views

About this video

Hand-picked by a BrighterTube curator · found via Awesome YouTube Channels for DS/AI/ML/CS (yt-channels-DS-AI-ML-CS · 86% confidence

Explains Edmonds-Karp max flow: why choosing augmenting paths with breadth-first search bounds the running time, with an animated residual graph; a short, precise network-flow lesson.

The Edmonds–Karp max-flow algorithm using BFS augmenting paths.

Video by WilliamFiset, played through YouTube's embedded player.

Part of Network Flow playlist, Graph Theory Playlist