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 be obtained the optimal solution, but because it traverses many computing nodes, so the low efficiency
To Search:
File list (Check if you may need any files):
Dijkstra算法实验报告.doc
Download