Description: Dijkstra Algorithm idea: Every time out from the VS special path with the shortest length of vertex u, u will be added to the S in the same time, make the necessary changes to the array dist, if s contains all the vertices v, dist on the record from the source to the other the shortest path length between vertices.
To Search:
- [Cpp1] - Dijkstra algorithm, the realization of g
- [Dijkstra] - Dijkstra algorithm, the matrix is stored
File list (Check if you may need any files):
Dijkstra.txt
Download