Description: Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm. It is used to calculate the shortest path of a node to all other nodes. The main feature is that the starting point is centered and extended outward until the end of the expansion. Dijkstra algorithm is a typical shortest path algorithm, in many professional courses as a basic content, a detailed introduction, such as data structure, graph theory, operations research, and so on. Note that the algorithm requires no negative edges in the graph.
Problem Description: in undirected graph G= (V, E), assume that the length of each edge E[i] is w[i], and find the shortest path from vertex V0 to the rest of the points. (single source shortest path)
To Search:
File list (Check if you may need any files):
dijkstra.m
Download