Dinic algorithm | Maximum Flow Problem | Network Flow | Graphs | Data Structure

In this video, I have discussed Dinic's algorithm to solve Maximum Flow Problem. In Dinic’s algorithm, we use BFS to check if more flow is possible and to construct level graph.
I have explained the algorithm using an example and have implemented in C++ as well.

00:00 Introduction
00:08 Define Maximum Flow Problem
02:21 Terminologies (Residual Capacity, Residual Graph, Augmenting Level Path)
03:24 Dinic's Algorithm Pseudo Code
16:32 C++ implementation

Source Code: https://github.com/fit-coder/fitcoderyoutube/tree/master/graph

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For in-depth Graph theory and implementation details, please refer to the below videos:
Graphs Introduction: https://www.youtube.com/watch?v=4xMsNIPEkwA

Graph representation:
Adjacency Matrix: https://www.youtube.com/watch?v=x6N5FK6ArRk
Adjacency List: https://www.youtube.com/watch?v=3AtEzK4sowk
Incidence Matrix: https://www.youtube.com/watch?v=bP-8P8f8mAY

Traversal techniques:
BFS, Breadth First Search: https://www.youtube.com/watch?v=iYz-pG1CPIM
DFS, Depth First Search: https://www.youtube.com/watch?v=oO1857MQlcs

Shortest Path algorithms:
Dijkstra algorithm: https://www.youtube.com/watch?v=J12sfRYpW-M
Bellman Ford algorithm: https://www.youtube.com/watch?v=iGzZEJc_w3I
Floyd Warshall algorithm: https://www.youtube.com/watch?v=R0Srbd5ALN8

Minimum Spanning Tree:
Kruskal algorithm: https://www.youtube.com/watch?v=dYIWheKq5Xc
Prim algorithm: https://www.youtube.com/watch?v=NCpUwOqt41k

Topological sort (Kahn algorithm): https://www.youtube.com/watch?v=gDNm1m3G4wo

Articulation points / Cut vertices:
Tarjan algorithm: https://www.youtube.com/watch?v=qNVNoZJFp_g

Disjoint Set / Union Find: https://www.youtube.com/watch?v=0JE7hxr8c5c

Maximum Flow Problem:
Ford Fulkerson algorithm: https://www.youtube.com/watch?v=_UcOALraATY
Dinic algorithm:

Graph coloring / Chromatic number: https://www.youtube.com/watch?v=oikZlz1GNbo

Hamiltonian cycle: https://www.youtube.com/watch?v=jGRRBJlNtwI

Euler cycle (Fleury algorithm): https://www.youtube.com/watch?v=c0e50JIAMuM
#DataStructure,#Graphs,#FitCoder,#Algorithm,#competitiveprogramming

Видео Dinic algorithm | Maximum Flow Problem | Network Flow | Graphs | Data Structure канала Fit Coder