Algorithm and Realization of the Shortest Path in Bus Net
HU Huo-zhen · Microcomputer Development · 2005
The shortest path problem is a classical problem of the graph theory.Its aim is to find the shortest path between two arbitrary points in the graph.The shortest path problem in the traffic net is just to find the shortest path between two points.To prove the practicability, the algorithm of the shortest path in bus net aims to the least of number of changing. This paper produces an algorithm of the shortest path in bus net. It consults the breadth-first search.It finds all the buses which pass by the starting station and terminus. This paper gives its realization method.Secondly it gives an example.Finally it points out some new uses of this algorithm.