Graph Theory37 sections · 1633 units
Open in Course

Problem - Download Speed

(CSES 1694)

CSES problem: you have a computer network with nn nodes and mm connections. Each connection has a maximum data rate. Find the maximum download speed from computer 11 to computer nn. This is a direct application of max flow.

Computer 11 is the source, computer nn is the sink, and each connection is an edge with capacity equal to its data rate. Run Edmonds-Karp and output the maximum flow value. That is the answer.