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.

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

[Oops.] Typo in Maxflow-Mincut theorem #291

Open
EmaMaker opened this issue May 7, 2024 · 0 comments
Open

[Oops.] Typo in Maxflow-Mincut theorem #291

EmaMaker opened this issue May 7, 2024 · 0 comments

Comments

@EmaMaker
Copy link

EmaMaker commented May 7, 2024

Please verify that the error is present in the most recent revision before reporting.
Checked https://jeffe.cs.illinois.edu/teaching/algorithms/book/Algorithms-JeffE.pdf before posting (6th May 2024, at 15.30 CEST)

Chapter number or note title: 10.3 The Maxflow-Mincut Theorem

Page number: 333

Error description: The section claims that an augmented flow f' is feasible, then proceeds to prove the claim. However, when concluding the proof that the augmented path f' is feasible it says
So f is indeed feasible
I believe this is a typo and should say that f' is feasible

Suggested fix (if any): Replace f with f'

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant