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.
social.coop is a cooperatively-run corner of the Fediverse. The instance is democratically governed by its members, who generally share an interest in the co-op model, but topics of discussion range widely.
Our instance is supported by sliding scale contributions of $1-10/mo made via Open Collective. You must have an active Open Collective account to apply for membership; you may set one up here