A New Shortest Path Algorithm Using Cellular Automata Model
Zhijun Dai · Computer Technology and Development · 2009
On the base of one shortest path algorithm from one point to another point in a graph based on cellular automata model,it is pointed out that its critical step of subtraction of the smallest surplus weight in evolution rule of the algorithm is far from the basic thinking of classic shortest path algorithms from one point to another point in a graph,it should be left out .The critical step of subtraction of the smallest surplus weight is left out in a new algorithm of this article to raise the efficiency of algorithm greatly.At last,one example is used to show correctness and efficiency of this new algorithm by comparing evolution steps of these two algorithms..