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.