Math, asked by shahbazkhan81717, 21 days ago

The road network within the towns of Nevada State is represented by the following graph. The lengths of the roads between pairs of towns are represented by edge weights. A tourist visiting “Beatty” wants to travel towards “Warm Springs”. Which roads should be traveled by the tourist so that there is a path from Beatty to Warm Springs with minimum road length coverage? Also, find the length of the shortest path from Beatty to Warm Springs.

Attachments:

Answers

Answered by YOBROSlearning
3

Answer:

The answer is 50cm

Hope it helps you

Similar questions