Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Added Dinic's algorithm for maximum flow #207

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Added Dinic's algorithm for maximum flow #207

wants to merge 2 commits into from

Conversation

BH4
Copy link
Contributor

@BH4 BH4 commented Oct 25, 2019 

# Description

Added an implementation of Dinic's algorithm for maximum flow. Given a directed, weighted graph as a square matrix of weights and the indices for the sources and sinks it will return the maximum flow from sources to sinks.

## Type of change

- [x ] New Script

Aniket-Mishra
Aniket-Mishra approved these changes Jul 18, 2020
View reviewed changes
Copy link
Member

@Aniket-Mishra Aniket-Mishra left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Great work! Keep it up :D

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@Aniket-Mishra Aniket-Mishra Aniket-Mishra approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@BH4 @Aniket-Mishra