network/tree connecting clossest geometries

hi all

I'm trying to evaluate, from a starting point the closest geometries, and connect them in a treelike form. 

this is what i managed so far:

I'm not connecting the closest geometry (as in closest perimeter curve) but only working with the area centers, that seems to be easier, as it's only one point. Would like to imporve that in the future but it's not my main concern.

I define a radius and connect to the points within that radius, from those redefine the radius and so on...

It's like an iterative process that reevaluates the data each time, I managed to do it coping and pasting the code for each time:

but in more complex situations I wouldn't know how many times to copy it, and if I had 30 or 40 times it is kind of a mess, does anyone know another way of working these iterations?

here is my code so far

thank you!