“…This algorithm is designed to divide the original graph into K clusters (the number of K is set in advance) (Zaitseva, 2019;Zaitseva, et al, 2019aZaitseva, et al, , 2019bZaitseva, et al, , 2019c. The essence of the algorithm is that first, we find the shortest open path, and then we remove the (K-1) edge with the maximum weight.…”