Find the Number of Shortest Paths from A to B (8)

The Number of Shortest Paths from A to B Graph theory permutations and combinations

- Graph Theory

[bestchanatip]

I think to go from A to B to get the shortest path, the answer should be 16. I mean after you get the number 16 at the middle there, there is only one way to get to B, which is going straight. This is because the problem wants the shortest path.

[kushhhification]

I guess the answer is 16 cz you can't go downwards, that wouldn't be the shortest I guess. Nice way to solve the problem though by counting, thanks!