Computer Techs Edmond karp proof |
| Posted: 18 Dec 2019 05:49 PM PST Im having trouble understand about edmond karp proof In this post , is df(s,v)=df(s,u)-1 . What is d here? And why is it plus 1? Is distance here mean how many node from source or flow? For example there is path s->u->v Suppose distance from s to u is d Because there is flow from v to u , s-> u <- v, the shortest path from s to u will be d +1 +1? Why not shortest path is d? [link] [comments]  |
| You are subscribed to email updates from Computer Techs: Where no BSOD gets left behind.... To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment