Simplified algorithm on network shortest path problem

An algorithm on the network shortest path problem by gradually eliminating loops on a network is put forward. Using the wagon routing arrowhead line, we start from the origin, plot the routing arrowhead lines in the current loop and the adjacent loops, and decide which edge the arrowhead pointed to should be moved; then according to the structure of the candidate edges to be removed and certain regulations, remove one edge to enlarge the current loop; select the loop nearest to the origin and repeat the above process, until obtain the shortest routing tree taking the origin as its root. The case study carried out shows that the algorithm is simple, practical, knowable, and suitable for manual searching the shortest route on a simple non-directional network.