横向排列算法

List<NetunitModel> children = parent.getChildren();
int initX = 0;
int inity = 0;
int goup = 140;
int count = 7;
for (int i=0;i<children.size();i++){
if (i%count==0){
inity += goup;
initX = 10;
}
children.get(i).setConstraint(new Rectangle(initX, inity, -1, -1));
initX += goup;
}

竖向算法可以根据这个推算出来，我就不另做发表了