Say I have a set of nodes ('terminals') and one additional node ('source') in a network. I don't care how the source is connected to the terminals, but I want to minimize the total edge distance. The solution is most likely a hub-and-spoke model (limited to three or fewer tiers)...
I think (🤞) that #MinimumSpanningTrees are the answer. Make a distance matrix of all nodes, then find the shortest path through all of them.
Oooh, this could be combined with raster analysis to calculate shortest weighted distance. Nit for this project, though.
A Fediverse instance for people interested in cooperative and collective projects.