kumar83 wrote:

Source: Other -

http://www.majortests.com/gmat/problem_solving_test01Attachment:

1.gif

Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?

A. 10

B. 8

C. 6

D. 4

E. 2

Clockwise:

Lets assume Weight of A is 1, So the weight of B is 1 as only one route is there to reach.

Weight of C = 1+1 (2 ways to reach C from B) = 2

Weight of A (the last point in the journey ) = 2 + 2 (2 ways to reach A from C) = 4

Similarly for Anti-clokwise :

Lets assume weight of A is 1, so the weight of C = 1+1 (2 ways to reach to C from A) = 2

Weight of B = 2+2 (as there are 2 ways to reach B from C) = 4

Weight to reach A = 4 (as only one way to reach A from C) = 4

hence total is 4+4 = 8 ways (option B))

For any questions on route, this is the best way to solve.

_________________

Thanks,

Kinjal

My Debrief : http://gmatclub.com/forum/hardwork-never-gets-unrewarded-for-ever-189267.html#p1449379

My Application Experience : http://gmatclub.com/forum/hardwork-never-gets-unrewarded-for-ever-189267-40.html#p1516961

Linkedin : https://www.linkedin.com/in/kinjal-das/

Please click on Kudos, if you think the post is helpful