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

Network flow: fork Fulkerson algorithmn #477

Open
dejokz opened this issue Jan 7, 2022 · 1 comment
Open

Network flow: fork Fulkerson algorithmn #477

dejokz opened this issue Jan 7, 2022 · 1 comment
Labels
algorithms graphs.algorithms graphs

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
@dejokz dejokz mentioned this issue Jan 7, 2022
Closed
@czgdp1807
Copy link
Member

Sure go ahead.

@czgdp1807 czgdp1807 mentioned this issue Mar 2, 2022
Closed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithms graphs.algorithms graphs
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@dejokz @czgdp1807