the nodes are sorted on the basis of the total length of the shortest path passing the nodes as the weight and then the existing "subgraph+ ADD" algorithm is improved by using the heuristic idea of nodes with longer total path length first
resulting in a new subgraph+PLS algorithm.Computer simulation results show that the new algorithm effectively reduces time complexity in operations while retaining the accuracy of the results.