Any folks around? I have a problem that I need the right words to describe so I can search for solutions.

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)...

Thanks folks, typing that out gave me an idea I need to try. Maybe this is a hierarchical clustering problem followed by a linear programming problem to calculate the new node locations.

I think (🤞) that 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.

MST was only the beginning. Things are getting interesting now.

Sign in to participate in the conversation
social.coop

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.

If you are interested in joining our community, please review our Bylaws and Code of Conduct. If you agree with them, you may apply for membership on our instance via this link

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