Shortest Route Problems最短路径问题.pptVIP

Shortest Route Problems Traveling Salesperson Problem The traveling salesperson problem asks that a Hamiltonian circuit of least total weight be found for a graph. But what if you don’t need to visit every vertex but instead needed only to find the shortest route from one vertex to another? An efficient method for solving this type of problem does exist, an algorithm attributed to E. W. Dijkstra. Edsger W. Dijkstra E. W. Dijkstra was born in the Netherlands in 1930. He is considered to be one of the original theorists of modern computer science. He first published his algorithm about the shortest path algorithm in a German journal in 1959. Shortest Path Algorithm This is a modification of Dijkstra’s algorithm: Label the starting vertex S and circle it. Examine all edged that have S as an endpoint. Darken the edge with the shortest length and circle the vertex at the other endpoint of the darkened edge. Examine all uncircled vertices that are adjacent to the circled vertices in the graph. Algorithm (cont’d) Using only circled vertices and darkened edges between the vertices that are circled, find the lengths of all paths from S to each vertex being examined. Choose the vertex and edge that yield the shortest path. Circle this vertex and darken this edge. Ties are broken arbitrarily. Repeat Steps 2 and 3 until all vertices are circled. The darkened edges of the graph form the shortest routes from S to every other vertex in the graph. Example Use the shortest path algorithm to find the shortest path form A to F in the graph. Using the Algorithm To find the solution to this problem, begin by circling vertex A and labeling it S. Examine all vertices that are adjacent to S. Shortest Route The shortest route from A to F is A, C, D, F and the length is 10. The darkened edges show the shortest routes from A to the other vertices in the graph. Graph Practice Problems Use the shortest path algorithm to find the shortest route from A to F. Practice Problems (cont’d) Us