Max Flow
Channel:
Subscribers:
2,730
Published on ● Video Link: https://www.youtube.com/watch?v=B_Ex-hpHn_c
2Our third major graph theory algorithm is max flow, in which edges represent some amount per second that can be transported between one vertex and another. A max flow algorithm looks at a graph containing these edges, and computes the maximum flow between a source (s) and a sink (t).
Other Videos By Bill Kerney
| 2021-10-18 | Framing |
| 2021-10-16 | Fallacies: Appeal to Ignorance, Correlation is Causation |
| 2021-10-15 | The Society of Creative Anachronism |
| 2021-10-15 | C++ Member Functions |
| 2021-10-14 | Recursion Part I |
| 2021-10-14 | Linear Algebra for Games |
| 2021-10-14 | Level Design Flow |
| 2021-10-13 | Constructors and Destructors Part II |
| 2021-10-13 | Constructors and Destructors, Physics Simulation (Part 1) |
| 2021-10-13 | Red Herring, Non-Sequitur, Strawman, Ad Hominem, Tu Quoque |
| 2021-10-12 | Max Flow |
| 2021-10-12 | Markov Chaining (to generate Fake Alex Jones) |
| 2021-10-12 | Color, Story, Level Design |
| 2021-10-12 | Debugging; Pitch Documents; Time; Timelines to Make a Door |
| 2021-10-11 | Week 10 Day 1 - Classes Part I |
| 2021-10-11 | Fallacies Part III |
| 2021-10-08 | New/Delete, Stack vs. Heap, Old C++ vs. Modern C++ |
| 2021-10-08 | Fallacies of Composition/Division/Circular Logic |
| 2021-10-07 | Adding Skeletal Animations to UE4 |
| 2021-10-07 | Dijkstra Part II + Minimal Spanning Trees |
| 2021-10-07 | Making a 3D Engine in a Terminal |
Tags:
csci 26
max flow
graph theory