What are the maximum number of ways or paths in
which you can go from place 'A' to place 'B', provided
you can cross any junction only once in each
journey? [C, D, E, F, G, H are junction points]
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We have 4 ways to reach D or G, where we have 2 ways respectively to reach B.
4x2=8