engineering recuitment GATE CSE 2023-24 Test Series Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1.
Number of paths from A to K are ________
Enter numerical value using the virtual keypad. Round off where necessary.