This is an old revision of the document!
Table of Contents
Week 10
Chapter Scores
| Readability Score | 8 / 10 |  |
| Interest Score | 9 / 10 | |
Readings
Chapter 7: Network Flow
7.1: The Maximum-Flow Problem and the Ford-Fulkerson Algorithm
A flow network is a specific kind of graph that has a node that is the source of some sort of traffic, directed edges indicating the maximum amount of allowed traffic between two nodes, and a node that is the destination of all of the traffic. The amount of traffic flow coming from the source node must equal the amount of traffic flow leaving the graph through the destination node. Additionally, the amount of flow into and out of any node must be conserved such that the amount of flow into a node is equal to the flow out of a node.
7.2: Maximum Flows and Minimum Cuts in a Network
7.5: The Bipartite Matching Problem
7.7: Extensions to the Maximum-Flow Problem
You could leave a comment if you were logged in.
