-
Notifications
You must be signed in to change notification settings - Fork 313
Network flow: fork Fulkerson algorithmn #477
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.
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
Labels
Comments
Sure go ahead. |
@czgdp1807 I would love to work on this, if no one is currently working on this |
@czgdp1807 Sir I would like to work on this algorithm. As this issue is still not resolved. |
this issue is solved isnt it? |
But the issue was not closed. Right? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Description of the problem
Given a graph that represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink ‘t’ in the graph, find the maximum possible flow from s to t with the following constraints:
a) Flow on an edge doesn’t exceed the given capacity of the edge.
b) Incoming flow is equal to outgoing flow for every vertex except s and t.
References/Other comments
Video
Article
The text was updated successfully, but these errors were encountered: