I asked someone else what my first steps with this problem should be, and they suggested trying to find the minimum spanning tree with Kruskal's algorithm, but I don't understand how I could use that here. They haven't solved this kata either, but that was what they were going to start with. Is Kruskal's the way to go here? I don't think this problem needs graphs...