Anonymous,HowGan

The following graph shows a network of links joining nodes K, L, M, N, O, P and Q. The numbers between the towns is the distance.
The question is what would be the shortest route to go round the entire network beginning and ending at L. The circuit must go through every road and you can back track.
Thank you :)

sponsored
3 months ago 0

Answers

sponsored

Leave A Reply

 Prev Questions

Next Questions