Problem #76 MEDIUM
The Toll Road Dilemma
Amazon Adobe Graph Theory Optimization
Problem Statement
A city planner is designing a new toll road network. There are 5 cities connected by roads with the following travel costs (in hundreds of rupees): City 1 to City 2 costs 4, City 1 to City 3 costs 2, City 2 to City 3 costs 1, City 2 to City 4 costs 5, City 3 to City 4 costs 8, City 3 to City 5 costs 10, City 4 to City 5 costs 2. What is the cheapest route from City 1 to City 5, and what is its total cost?
Answer & Quick Explanation
Logged-in Users Only
You must be logged in to view the answer and check your solution. Signing up is free and takes less than a minute.
Detailed Editorial Solution
Detailed Editorial Solution is Premium
Unlock detailed step-by-step mathematical proofs, logic explanations, and company-specific interview preparation pathways.