Try Notedeck free · More Operations Research demos
← Notedeck 运筹学 · Network maximum flow Try in Notedeck

Network maximum flow — interactive Operations Research demo

Ford–Fulkerson augmenting paths · max-flow = min-cut

Run this interactive Operations Research demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.