Flow networks are directed graphs with edges that have capacities and flows. The flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it. They can be used to model traffic in computer networks, fluids in pipes, or currents in electrical circuits.
Carnegie Mellon University
Fall 2021
This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.
No concepts data
+ 13 more concepts