Flows and Connectivity · Flows

Lesson 1

Nikolai Chukhin · Alexander S. Kulikov

Problem. The graph below represents a transportation network. Vertex \(S\) is a factory where goods are produced that need to be delivered to a store \(T\). All other vertices are warehouses. Some vertices are connected by roads, and each such road has a capacity — the maximum number of units of goods that a truck can transport from one vertex to another per day. We want to set up a daily delivery plan from the factory to the store such that goods do not accumulate at warehouses. What is the maximum number of units of goods that can be transported from the factory to the store per day?

5 points