w*****l
发帖数: 4 | 1 This is a typical maximal flow question. Set the flow limit of
each edge to be one. The maximal number of couriers equals to the
maximal flow from s to t.
To compute the maximal flow, you can figure out the mimimum cut of the
graph, the according to a "maximal-flow-minimal-cut" theorem, they equal. |
|
