There are multiple routes to reach from node 1 to node 2, as shown in the…
2020
There are multiple routes to reach from node 1 to node 2, as shown in the network.
The cost of travel on an edge between two nodes is given in rupees. Nodes ‘a’, ‘b’, ‘c’, ‘d’, ‘e’, and ‘f’ are toll booths. The toll price at toll booths marked ‘a’ and ‘e’ is Rs. 200, and is Rs. 100 for the other toll booths. Which is the cheapest route from node 1 to node 2 ?
- A.
1−a−c−2
- B.
1−f−b−2
- C.
1−b−2
- D.
1−f−e−2
Attempted by 106 students.
Show answer & explanation
Correct answer: B
Correct route: 1−f−b−2 with total cost Rs. 500.
Edge costs: 1→f = 100, f→b = 0, b→2 = 200 → sum = 300.
Tolls on route: f = 100, b = 100 → sum = 200.
Total cost = edge costs (300) + tolls (200) = Rs. 500, which is lower than the totals for the other routes.
A video solution is available for this question — log in and enroll to watch it.