Finding the Cheapest Layout with NetworkX's Minimum Spanning Tree
Model a city-wiring problem as a weighted graph and use NetworkX's minimum_spanning_tree to get the lowest-cost connection plan, with a worked example and a unit test.
Loading…
ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Model a city-wiring problem as a weighted graph and use NetworkX's minimum_spanning_tree to get the lowest-cost connection plan, with a worked example and a unit test.
python
networkx