read other similar posts here discussed in the forum .
total no. of paths= no. of paths from X to B*total no. of paths from b to Y
In the given figure, u have the road plan of a city. A man standing at X wants to reach the cinema hall at Y by the shortest path.
(i) Find the no. of different paths that he can take.
(ii) Find the no. of shortest routes frm X to Y via B.
read other similar posts here discussed in the forum .
total no. of paths= no. of paths from X to B*total no. of paths from b to Y