PROBLEM LINK:
Author: Manas Rawat
Tester: Aagam Jain
Editorialist: Manas Rawat
DIFFICULTY:
MEDIUM
PROBLEM:
You have been given a road map of a town in the form of a weighted graph you have to tell the maximum number of vehicles the road can fit at a time while going from House 1 to House N.
QUICK EXPLANATION:
If we break down this problem then it can be seen as a very standard problem of Max Flow and can be easily solved with the Edmonds-Karp Algorithm. You can read about the full algorithm here.
SOLUTIONS:
Solution can be found here.