// coding · modul 25Yuqori8 mavzu · ~5 soat

Network Flow

Max Flow (Ford-Fulkerson, Edmonds-Karp, Dinic), Min Cut, Bipartite Matching.

0/8 · 0%

Bu modul — Premium

Darslarni ochish uchun Premium obuna kerak. Dastlabki 3 ta modul bepul.

Darslar

8 ta dars

1Max Flow — Maksimal oqimHOZIR+10

2Min Cut va Max Flow - Min Cut teoremasi+10

3Bipartite Matching — ikki tomonlama mos kelish+10

4Network Flow — yakuniy masalalar+10

5Centroid Decomposition+25

6Heavy-Light Decomposition+30

7Max Flow — Ford-Fulkerson, Dinic+20

8Advanced Graph masalalari+40