Description: Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center layers expand outward until the extended until the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it is through a lot of computing nodes, so the efficiency is low.
To Search:
File list (Check if you may need any files):
dijkstra（模板样例）.doc
Download