The Edmonds-Karp algorithm is a polynomial-time algorithm for finding the maximum flow in a flow network.
Questions tagged [edmonds-karp]
37 questions
0
votes
0 answers
Why are the elements in my heapq not ordered python?
I am using a simple heapq in python with custom elements on which I implemented the lt function.
class Edge:
def __init__(self, cost, u, v):
self.u = u
self.v = v
self.cost = cost
def weight(self):
w =…
Traoré Moussa
- 433
- 1
- 6
- 22
0
votes
1 answer
How do we break a tie in shortest length of augmenting in the edmonds-karp algorithm?
So if the 2 shortest augmenting paths are length 2, what is the secondary filter?
From what I understand, Edmonds-Karp chooses the shortest path, that is, the path with the least amount of edges.
However, both of these paths are length 2. So does…
User
- 23,729
- 38
- 124
- 207
0
votes
0 answers
What does it mean to augment flow?
When the Edmonds-Karp algorithm says to augment flow f along path p, what does it actually mean to augment the flow? Does it mean to send the flow along the path?
User
- 23,729
- 38
- 124
- 207
0
votes
2 answers
3 max flow prove or disprove small questions
The questions are :
for (a) it seems like it is not true, we can fin an example of the flow growing without e being saturated.
for (b) it seems true, yet i am not sure how to prove it. Maybe because of the
min cut max flow theorm, it was on the min…
NotSure
- 651
- 2
- 7
- 24
0
votes
0 answers
Why is Edmond Karps faster than Ford-Fulkerson?
Why choosing the shortest augmentation path everytime instead of an arbitrary augmentation path makes the Edmond Karps algorithm faster than Ford-Fulkerson
Bogdan Pop
- 318
- 1
- 3
- 12
0
votes
1 answer
Edmonds Karp algorithm and 0 1 capacities
What is the Edmonds Karp (BFS) upper bound when the only available capacities are 0 and 1?
I don't understand the difference when the capacities are only 0 and 1, I know that Ford Fulkerson finds that flow value is 0 or 1, if the capacities are 0…
Bobbbaa
- 199
- 2
- 12