Download Speed - Modeling

Model the network as a flow graph:

$1.$ Nodes: the $n$ computers.

$2.$ Edges: each connection $(a,b)$ with speed $c$ becomes a directed edge with capacity $c$.

$3.$ Source: node $1$.

$4.$ Sink: node $n$.

Since the connections are bidirectional, add both $(a,b)$ and $(b,a)$ with capacity $c$. The max flow algorithm will use whichever direction is better. This models the ability to route data in either direction on each link.