Dinic's algorithm
vedant-z opened this issue · comments
This is a(n):
- New algorithm
- Update to an existing algorithm
- Error
- Proposal to the Repository
Details:
Dinic's algorithm is used to solve maximum flow questions
A matching in a graph is a set of edges that does not have common vertices (i.e., no two edges share a common vertex). A matching is called a maximum matching if it contains the largest possible number of edges matching as many vertices as possible.
@AdiChat Please assign this issue to me
@AdiChat I want to add new algorithm
I would like to do this task ,can you assign me.