graph theory

Question

Comments

33 is the right answer

---

Yes 33 is the answer 

length 0 : 0
length 1 : 0
length 2 : 1
length 3 : 6
length 4 : 12
length 5 : 10
length 6 : 4
length 7 : 0
length 8 : 0

This is output of a program that tells number of ways to reach from source to destination of path length 'k'

May be it helps :p

---

any general formula for this type of question?

Answer 1

Just Apply the Topological Sort !