The power company needs to lay updated distribution lines connecting the ten Oregon citics below to...

Transcribed Image Text:

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

Answer rating: 100% (QA)

Here is how I would solve this using Kruskals algorithm and the NetworkX package in ... View the full answer