Flux maxim.

Cuplaj in graf bipartit

Dinic's Algorithm | Network Flow | Graph Theory

Atentie: fluxul nu e maxim!

// drum de crestere : s-a-b-d-c-t - capacitate reziduala 1

k cercetatori -> n proiecte

fiecare cercetator Pi -> Prj,j+1,...Prj+t
Fiecare cercetator are voie sa lucreze la maxim 2 proiecte
Exista o astfel de asignare?
Pr1 - are nevoie de x1 cercetatori
Pr2 - x2 cercetatori
…

Cuplaj:

Hopcroft–Karp algorithm

https://pastebin.com/q12aBwya

Dinic la cuplaj -> Hopcroft-Karp (de ce?)

https://en.wikipedia.org/wiki/Hall%27s_marriage_theorem
https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem

Cum recunoastem flux / cuplaj?

https://www.infoarena.ro/problema/cuplaj
https://www.infoarena.ro/problema/fmcm
https://vjudge.net/contest/412896#problem/D
https://codeforces.com/gym/101981
//flow, flow-matching-like, mcmf
https://codeforces.com/blog/entry/55274

Simulari flux, cuplaj:

https://vjudge.net/contest/478863
https://vjudge.net/contest/478864

Link prezentare Princeton:

https://www.cs.princeton.edu/~wayne/cs423/lectures/max-flow-applications