nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…
ole refresh part so that it will try one combination at a time. I dont have a full understanding of how to do this given that everything in GH is runtime.
Outputs: A,B,C,D
A0: Cat
B0: Cat
C0: Cat
D0: Cat
A1: Cat
A2: Cat
A3: Cat
A4: Dog
etc, per refresh.....…