Rural E-commerce Customer Path Planning Based on Dijkstra Algorithm

Abstract

With the popularization of e-commerce, the competition among enterprises is becoming more and more fierce, and improving the efficiency of logistics and distribution and reducing operating costs have become the focus of e-commerce enterprises. Dijkstra's algorithm is a kind of greedy algorithm, which has become a classic algorithm for solving the shortest path problem, and is often used to solve network path problems or assisted calculation of complex graph theory algorithms. The Dijkstra algorithm can obtain the optimal choice of the shortest path in the area, and is suitable for solving the single-source shortest path problem in the loop network without negative weight. Due to the large number of traversed nodes, sometimes the algorithm is not efficient. This paper analyses the typical path planning algorithm, designs the data storage structure, and focuses on the process of Dijkstra algorithm. The rural e-commerce customer path planning should follow the basic rules of economy, adaptability and strategy, integrate information flow, capital flow and commodity flow, and build a new pattern of modern rural e-commerce with the information network as the hub.