Question

The road network within the towns of Nevada State is represented by 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 travelled 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.

Answer 1

I don't know how to answer your question