Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Cycle-cancelling algorithm

A tough choice

Report a typo

One company cannot decide which place it should send the goods to: Manchester or Sheffield. In order to decide, the management developed a map for each town. A map illustrates the roads, the amount of products that can be passed through each of them daily and the cost of sending one unit of goods through a road.

It was discovered, that the maximum amount of products that can be sent to each town is the same. Therefore, the company will choose a town, which it is cheaper to deliver to. Which town should be chosen?

A map of the delivery chain of produce from Leeds to Manchester

A map of the delivery chain of produce from Leeds to Sheffield

Enter a short text
___

Create a free account to access the full topic