边权值可以表示距离.pptVIP

边的权值可以表示距离、时间、运费、票价、线路月租费等。 7.6 Shortest Path Problems Example 1 What is the length of the shortest path between a and z in the weighted graph shown in Figure 3? Solution :Although the shortest path is easily found by inspection,we will develop some ideas useful in understanding Dijkstra’s algorithm. We will solve this problem by finding the length of the shortest path from a to successive vertices ,until z is reached. The only paths starting at a that contain no vertex other than a (until the terminal vertex is reached)are a,b and a,d. Since the lengths of a,b and a,d are 4 and 2,respectively,it follows that d is the closest vertex to a . We can find the next closest vertex by looking at all paths that go through only a and d (until the terminal vertex is reached ).The shortest such path to b is still a,b, with length 4,and the shortest such path to e is a,d,e,with length 5.Consequently,the next closest vertex to a is b . To find the third closest vertex to a, we need to examine only paths that go through only a,d,and b (until the terminal vertex is reached).There is a path of length 7 to c,namely,a,b,c,and a path of length 6 to z ,namely,a,d,e,z.Consequently,z is the next closest vertex to a, and the length of the shortest path to z is 6 . Algorithm 1 Dijkstra’s Algorithm. Procedure Dijkstra(G: weighted connected simple graph, with all weights positive) {G has vertices a = v0, v1 , · · · ,vn =z and weights w(vi ,vj ) where w(vi ,vj )=∞ if {vi ,vj }is not an edge in G} For I := 1 to n L(vi ):= ∞ L(a):=0 S := ? {the labels are now initialized so that the label of a is zero and all other labels are ∞,and S is the empty set } While z ∈ S Begin u :=a vertex not in S with L(u) minimal S:=S∪ {u} for all vertices v not in S if L(u) +w(u,v)L(v):=L(u)+w(u,v) {this adds a vertex to S with minimal label and updates the labels of vertices not in S} End {L(z)=length of shortest path from a to z } Example 2 Theorem 1 Dijkstra’s algor