April 12, 2026
Max flow, max feels
Network Flow Algorithms
Free network textbook drops (legit!) — students cheer, pirates grumble, vets debate
TLDR: David P. Williamson posted a legally free, electronic-only edition of his graduate “Network Flow Algorithms” textbook, with Cambridge’s permission. Comments celebrate modern coverage (like electrical flows) while arguing over redistribution limits and whether another textbook was needed—students rejoice, archivists protest, and the water-wheel cover becomes meme fuel.
The math-and-code corners of the internet lit up when Cornell’s David P. Williamson dropped a free, electronic-only edition of his graduate textbook, Network Flow Algorithms, with Cambridge University Press’s blessing. Network flow = figuring out the best way to move stuff (packages, information, even pixels) through a network. The book pulls together heavy hitters like maximum flow, minimum-cost routing, and newer stars like electrical flows, plus rarely covered gems like Goldberg–Rao and multicommodity flows.
Cue the comments war. One camp is throwing confetti—“a legit free textbook that isn’t a relic!” Another is side-eyeing the terms: it’s personal-use only, no reposting. “If I can’t mirror it, it’s not open,” grumble perennial archive warriors. Meanwhile, the old guard spar with newcomers: “Do we need another flow book?” vs “Finally, generalized flows get equal billing.”
Memes flowed. The cover’s sakia (a water-lifting wheel) became instant fodder: “Peak on-brand.” Others joked the server hit “max flow” as downloads surged. Practical minds flagged extras: a Cornell course search with lecture videos and an errata email at “bugs@networkflowalgs.com.” For shoppers, the ISBN search made the rounds.
Beginners asked if it’s for them; veterans replied it’s a graduate text—tough but clear. Love it or nitpick it, the verdict is in: the PDF is legal, the debates are loud, and the flow jokes are unstoppable.
Key Points
- •“Network Flow Algorithms” by David P. Williamson was published in 2019 by Cambridge University Press.
- •The book provides a unified treatment of efficient combinatorial algorithms for network flow problems, including topics often not covered elsewhere.
- •Covered topics include maximum flows, minimum-cost flows, generalized flows, multicommodity flows, global minimum cuts, and electrical flows and their applications.
- •An electronic-only edition is available for personal use via the website, with restrictions on redistribution; ordering via ISBN 9781316636831 is also provided.
- •Supplementary materials include a Cornell course (ORIE 6330) with syllabus and lecture videos, and an errata page will be posted; corrections can be emailed.