Читать книгу Handbook of Intelligent Computing and Optimization for Sustainable Development - Группа авторов - Страница 233

To get the minimum spanning tree, we have two cases, even and odd. In even case node is always multiple by 2 in loop and in odd node is represented as n. We get the coordinates of the vertical and horizontal lines separately for each case. At the end, we put or apply the fitting function to get the minimum coordinates in the deployment area as shown in Figure 6.16.