Research on the Dijkstra Algorithm Based on Grover Algorithm

摘要：

The shortest path problem is the very important problem in the graph theory. Dijkstra algorithm and Bellman-fold algorithm are two main algorithms in the shortest path problem. This paper introduces the Dijkstra algorithm firstly, and then put forward Grover algorithm. This paper builds the Grover model to solve the Dijkstra problem.

关键词： Dijkstra algorithm shortest path problem Grover algorithm

作者: Xuejun Wu

作者单位: College of Science,Zhejiang University of Technology,Hangzhou,Zhejiang,China

会议类型: 国际会议

会议名称: The Third International Conference on Modelling and Simulation(第三届国际建模、计算、仿真、优化及其应用学术会议 ICMS 2010)

会议地点: 无锡

会议语种:英文

页码: 38-41

在线出版日期: 2010-06-04（万方平台首次上网日期，不代表论文的发表时间）