最短路径问题及其解法研究

最短路径问题是在给定的网络图中寻找出一务从起始点到目标点之间的最短路径。该文分别从动态规划、Dijkstra、A＊算法、遗传算法这四种算法设计方法入手，概述了各种设计方法的原理，提出了求解最短路径的算法思想，并对算法进行分析．提出了改进方法。

Shortest Path Problem and its Solution Methods Study

Shortest path problem is to find a shortest path from the start point to the end point in a given net graph.This paper will intro-duce four algorithm design methods,which are Dynamic programming,Dijkstra algorithm,A-star algorithm,Genetic algorithm,summarize their basic tenets,give the solving algorithm thought to the shortest path problem,analyse the algorithms and put forward the improving methods.