edited by
4,282 views
14 votes
14 votes

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 $\text{‘}a\text{’}, \text{‘}b\text{’}, \text{‘}c\text{’}, \text{‘}d\text{’}, \text{‘}e\text{’},$ and $\text{‘}f\text{’}$ are toll booths. The toll price at toll booths marked $\text{‘}a\text{’}$ and $\text{‘}e\text{’}$ is Rs. $200$, and is Rs. $100$ for the other toll booths. Which is the cheapest route from node $1$ to node $2$?

  1. $1-a-c-2$
  2. $1-f-b-2$
  3. $1-b-2$
  4. $1-f-e-2$
edited by

1 Answer

Best answer
10 votes
10 votes

$A) 1-a-c-2 :$

  • $1-a = 200$
  • Tax at $a =200$
  • $a-c = 100$
  • Tax at $c = 100$
  • $c-2 : 100$
  • Total $= 200+200+100+100+100 = 700$

$B) 1-f-b-2 :$

  • $1-f = 100$
  • Tax at $f =100$
  • $f-b = 0$
  • Tax at $b = 100$
  • $b-2 : 200$
  • Total $= 100+100+0+100+200 = 500$

$C) 1-b-2 :$

  • $1-b = 300$
  • Tax at $b = 100$
  • $b-2 : 200$
  • Total $= 300+100+200 = 600$

$D) 1-f-e-2 :$

  • $1-f = 100$
  • Tax at $f =100$
  • $f-e = 100$
  • Tax at $e = 200$
  • $e-2 : 200$
  • Total $= 100+100+100+200+200 = 700$

Cheapest route $= 1-f-b-2$

Correct Option: B

edited by
Answer:

Related questions

15 votes
15 votes
4 answers
2
28 votes
28 votes
6 answers
4
Arjun asked Feb 12, 2020
13,653 views
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is...