中文摘要：

在一个基于元胞自动机模型的求图中一个顶点到另一个顶点的最短路径的算法的基础上。分析出：它的关键部分（即演化规则）中“减最小剩余权”这一重要步骤与求图中一个顶点到另一个顶点的经典的最短路径算法的基本思想相距甚远，应该省去。在提出的新算法中省去“减最小剩余权”这一重要步骤，这个改进较大地提高了算法的效率。最后通过举例子分别用两个算法进行求解，通过这些求解步骤的对比，明显看出本算法的正确性和高效性。

英文摘要：

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 evolurion 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.