离散数学课件6-6 shortest-Path Problems 33.pptx

Discrete Mathematics South China University of TechnologyChapter 8. GraphsShortest-Path ProblemsSection 8.6Contents1Shortest Path Problems2Dijkstra’s Algorithm3The traveling salesman problemShortest Path ProblemsIntroductionMany problems can be modeled using graphs with weights assigned to their edges.Problems involving distances can be modeled by assigning distances between cities to the edges.Problems involving flight time can be modeled by assigning flight time to the edges.Problems involving fares can be modeled by assigning fares to the edges.Dijkstra’s AlgorithmA Shortest-Path AlgorithmThere are several different algorithms that find a shortest path between two vertices in a weighted graph.This section will present the classical algorithm: Dijkstra’s Algorithm proposed by Dutch mathematician Edsger Dijkstra.324bc3az213deThe 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, d is the closest vertex to a.324bc3az213deWe can find the next closest vertex by looking at all paths that go through only a and d.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. So the next closest vertex to a is b.324bc3az213deFor the next 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. So z is the next closest vertex to a, and its length is 6.Dijkstra’s idea?Given start vertex s, find the shortest path from s to all other vertices ?the length of edge Lthe length between vertex and .: the vertexes set of shortest path.Dijkstra’s idea?initialization: L2. search 3. 4. for each vertex if L+ then LL+Repeat 2,3,4 until P=V.Algorithm 1: Dijkstra’s AlgorithmProcedure Dijkstra (G: weighted connected simple graph, with all weights