Add Dinic's Algorithm
Open
Nobody has claimed this yet.
- #422 by @Saj18 — closed without merging
core
development
enhancement
good first issue
hacktoberfest
- Dominant language
- C++
- Stars
- 729
- Forks
- 147
- Avg merge
- 19h
- Merged PRs (30d)
- 1
Description
Please add Dinic's Algorithm for computing the maximum flow.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing closed pull request #422 and the surrounding issue discussion to understand whether an implementation was attempted and what remains. Then inspect the graph-algorithm entry points and existing maximum-flow code, if any. Done means Dinic's Algorithm is integrated into the C++ library and its maximum-flow behavior is covered by appropriate tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100