Shortest Path Problem and its Solution Methods Study
Zhou Xian-shu · Computer Knowledge and Technology · 2010
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.