MathCastle
Graph TheoryEasyDirected Graphs and Network Flows

Directed Graphs and Network Flows · Easy problem

A shipping hub is the source ss of a network whose only two outgoing roads have capacities c(s,a)=6c(s,a)=6 and c(s,b)=4c(s,b)=4 (units per hour). No matter how the rest of the network is built, what is the largest total flow value the hub could ever send out per hour?