Introduction - If you have any usage issues, please Google them yourself
Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm is very representative of the shortest path algorithm, described in detail in many professional courses as a basic content, such as data structures, graph theory, operations research, etc.. Dijkstra general statements are generally two ways, a permanent and temporary label, an OPEN, CLOSE table, here are the way of permanent and temporary label. Note that the algorithm requires that the figure does not negative the right side.