The power exompany needs to lay updated distribution lines connecting the ten Orcgon citics below to the powcr grid....

Transcribed Image Text:

The power exompany needs to lay updated distribution lines connecting the ten Orcgon citics below to the powcr grid. How can they minimize the amount of new line to lay? 374 200 223 108 178 252 285 240 356 Ashland Astoria Bend 374 255 166 433 199 135 95 136 17 200 255 128 277 | 128 180 160 131 | 247 47 153 178 344 389 423 Corvalis 223 166 128 130 52 84 40 155 Crater Lake 108 433 277 430 Eugene Newport 178 199 128 47 453 110 64 91 114 181 252 135 180 52 478 91 83 117 Portland 285 95 160 84 344 110 114 47 78 Salem Scaside 240 136 131 40 389 64 83 47 118 356 17 247 155 423 181 117 78 118 a.) Using Kruskal's algorithm to find a minimum cost spanning tree. b.) Solve this problem using Python's THetworkx package. Ashland Astoria ESEE Crater Lake ZE Newport EA Portland Scaside

Answer rating: 100% (QA)

a To find the minimum cost spanning tree using Kruskal s algorithm we can follow these steps 1 Create a list of all the cities and their corresponding distances 2 Sort the distances in ascending order View the full answer