Searching Continuous Nearest Neighbor in Transport Network

This article proposes a method of searching continuous nearest neighbors in transport network through reducing both the number to count the nearest neighbors and storage space to run the algorithm. A calculation method of split nodes is put forward and an algorithm of searching continuous nearest neighbors (SCNN) is given. Both the correctness and the termination of the algorithm are proved and the complexity of the algorithm is analyzed. It is concluded that the SCNN algorithm is more suitable for the practical transport network in which the road network nodes are changed frequently than other relevant algorithms.