Dijkstra algorithm to find the shortest path problem how to write the complete C code

Dijkstra algorithm to find the shortest path problem complete C code how to write, I believe that many inexperienced people do not know what to do, so this paper summarizes the causes of the problem and solutions, through this article I hope you can solve this problem.

Basic idea and process of algorithm

The single-source shortest path problem is to find the shortest path from a given vertex to any other vertex in the graph. Before figuring out how to solve the single-source shortest path problem, we must find out the optimal substructure properties of the shortest path.

one。 Optimal substructure properties of the shortest path

This property is described as follows: if P (iMagnej) = {Vi....Vk..Vs...Vj} is the shortest path from vertex I to j, and k and s are an intermediate vertex on this path, then P (KMague s) must be the shortest path from k to s. The correctness of this property is proved below.

Suppose that P (iMaginj) = {Vi....Vk..Vs...Vj} is the shortest path from vertex I to j, then there is P (iMaginj) = P (iMagol k) + P (kMagnec s) + P (sPermie j). If P (KMagol s) is not the shortest distance from k to s, then there must be another shortest path from k to s, then P'(iMague j) = P (iMagazine k) + P'(kMagazine s) + P (sMagnej) ver [iForce +] = Ver; g-> ver [I] ='\ 0mm; VertexNum = strlen (g-> ver) Printf ("Please enter the corresponding adjacency matrix:\ n"); for (iS0; I