1,313 views

The figure below shows the network connecting cities A, B, C, D, E and F. The arrows indicate permissible direction of travel. What is the number of distinct paths from A to F?

1. $9$
2. $10$
3. $11$
4. None of these

(E) = 1
(C) = (E) + 1 = 2
(D) = (C) + (E) = 3
(B) = 1 + (C) + (D) + (E) = 7
(A) = (B) + (D) = 10.
by
8.3k points

### 1 comment

yes. good one :)
by
5.1k points

how?
just counted number of directed path, nothing special :)
okay :) but can be solved using dynamic programming :)