Question:

The network diagram shows cities A, B, C, D, E, F with arrows as permissible travel. How many distinct paths exist from A to F?

Show Hint

For path counting in DAGs, work backwards from destination, summing incoming edges’ path counts.
Updated On: Aug 4, 2025
  • 9
  • 10
  • 11
  • None of these
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

List paths manually or use dynamic counting:
From E to F = 1 path, C to F = 1, D to F = 1.
E gets from B: add B$\to$E direct plus via C etc. Count stepwise gives total 11.
Was this answer helpful?
0
0