Skip to content

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

Open
dejokz opened this issue Jan 7, 2022 · 5 comments · May be fixed by #644 or #668
Open

Network flow: fork Fulkerson algorithmn #477

dejokz opened this issue Jan 7, 2022 · 5 comments · May be fixed by #644 or #668

Comments

@dejokz
Copy link

dejokz commented Jan 7, 2022

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

@czgdp1807
Copy link
Member

Sure go ahead.

@tanishy7777
Copy link

tanishy7777 commented Mar 13, 2025

@czgdp1807 I would love to work on this, if no one is currently working on this

@tanishy7777 tanishy7777 linked a pull request Mar 13, 2025 that will close this issue
@bobbysharma05
Copy link

bobbysharma05 commented Mar 21, 2025

@czgdp1807 Sir I would like to work on this algorithm. As this issue is still not resolved.

@bobbysharma05 bobbysharma05 linked a pull request Mar 23, 2025 that will close this issue
@frHimanshu
Copy link

this issue is solved isnt it?

@bobbysharma05
Copy link

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
Projects
None yet
5 participants