4 votes 4 votes Graph Theory discrete-mathematics graph-theory + – Lakshman Bhaiya asked Jan 6, 2018 Lakshman Bhaiya 730 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Lakshman Bhaiya commented Jan 7, 2018 reply Follow Share 33 is the right answer 0 votes 0 votes gauravkc commented Jan 7, 2018 reply Follow Share 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 0 votes 0 votes Lakshman Bhaiya commented Jan 7, 2018 reply Follow Share any general formula for this type of question? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Just Apply the Topological Sort ! hacker16 answered Jan 7, 2018 hacker16 comment Share Follow See all 0 reply Please log in or register to add a comment.