Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Cycle-cancelling algorithm

Examining the traffic

Report a typo

Imagine that you want to prepare a survey on traffic in a town. You have the following map at your disposal. Each edge represents a road, and the number near each edge is the number of vehicles that may use the road and the average time of passing the road, separated by a comma. You want to find the minimum total time that the drivers need to spend. At the same time, you want to maximize the number of vehicles that reach point E from the point A.

So, how many minutes in total will they have to spend? Mind that your goal is to minimize the total time, while still keeping the number of vehicles maximum.

A network, containing information about the capacity and cost of each edge

Enter a number
___

Create a free account to access the full topic