Description: Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm is used to calculate a node to all other nodes in the shortest path. The main characteristics is the starting point as the center outward expansion layers until the extension to the end date. The Dijkstra algorithm shortest path algorithm is very representative of the many professional courses as a detailed introduction to the basic content, such as data structures, graph theory, operations research, and so on. The Dijkstra general statements are generally two ways, one with permanent and temporary label, OPEN, CLOSE table, here are a permanent and temporary label. Note that the algorithm requires that there is no negative side figure.
To Search:
File list (Check if you may need any files):
ShortestPathDijkstra.cpp
Download