Need help on this discrete math problem
9. The roads represented by this graph are all unpaved. The lengths of the roads between pairs of towns are represented by edge weights. Which roads should be paved so that there is a path of paved roads between each pair of towns so that a minimum road length is paved? (Note: These towns are in Nevada.)
Manhattan 00 55 80 Tanopah Warm Springs 40 Dyer 20 Silver Pea Goldfield 25 Lida Oasis 70 12 10 30 Deep Springs Gold Point Beatty
Need help on this discrete math problem
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Need help on this discrete math problem
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!