Description: Dijkstra algorithm is a typical shortest path algorithm to calculate a node to all other nodes of the shortest path. Main features are a starting point for the center layers expand outward, until the expansion to end up. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverses a lot of computing nodes, so efficiency is low. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses are as basic elements in some detail, such as data structures, graph theory, operational research and so on.
To Search:
File list (Check if you may need any files):
Dijkstra算法.doc