From 659d23b2a11526fe420d22b332cc31cc5d240c53 Mon Sep 17 00:00:00 2001 From: Kaustubh Dwivedi Date: Thu, 20 Jun 2024 23:18:20 +0530 Subject: [PATCH] Update edmonds_karp.md Made the explanation of augmenting path a little clearer. --- src/graph/edmonds_karp.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/graph/edmonds_karp.md b/src/graph/edmonds_karp.md index 29753eba1..fa4ec25bf 100644 --- a/src/graph/edmonds_karp.md +++ b/src/graph/edmonds_karp.md @@ -66,7 +66,7 @@ We can create a **residual network** from all these edges, which is just a netwo The Ford-Fulkerson method works as follows. First, we set the flow of each edge to zero. Then we look for an **augmenting path** from $s$ to $t$. -An augmenting path is a simple path in the residual graph, i.e. along the edges whose residual capacity is positive. +An augmenting path is a simple path in the residual graph where residual capacity is positive for all the edges along that path. If such a path is found, then we can increase the flow along these edges. We keep on searching for augmenting paths and increasing the flow. Once an augmenting path doesn't exist anymore, the flow is maximal. pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy