Shortest Path Problems.ppt

Shortest Path Problems Dijkstra’s Algorithm TAT ’01 Michelle Wang Introduction Many problems can be modeled using graphs with weights assigned to their edges: Airline flight times Telephone communication costs Computer networks response times Where’s my motivation? Fastest way to get to school by car Finding the cheapest flight home How much wood could a woodchuck chuck if a woodchuck could chuck wood? Optimal driving time Tokyo Subway Map Setup: G = weighted graph In our version, need POSITIVE weights. G is a simple connected graph. A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. A labeling procedure is carried out at each iteration A vertex w is labeled with the length of the shortest path from a to w that contains only the vertices already in the distinguished set. Outline of Algorithm Label a with 0 and all others with ?. L0(a) = 0 and L0(v) = ? Labels are shortest paths from a to vertices Sk = the distinguished set of vertices after k iterations. S0 = ?. The set Sk is formed by adding a vertex u NOT in Sk-1 with the smallest label. Once u is added to Sk we update the labels of all the vertices not in Sk To update labels: Lk(a, v) = min{Lk-1(a, v), Lk-1(a, u) + w(u, v)} Remarks Implementing this algorithm as a computer program, it uses O(n2) operations [additions, comparisons] Other algorithms exist that account for negative weights Dijkstra’s algorithm is a single source one. Floyd’s algorithm solves for the shortest path among all pairs of vertices. Endnotes 1 Endnotes 2 For Math 3975: * * UCLA In N’ Out The Red Garter My cardboard box on Sunset the beach (dude) 9 25 19 16 5 21 31 36 Using the previous example, we will find the shortest path from a to c. a i r c b 9 25 19 16 5 21 31 36 Label a with 0 and all others with ?. L0(a) = 0 and L0(v) = ? L0(a) = 0 L0(i) = ? L0(r) = ? L0(c) = ? L0(b) = ? 9 25 19 16 5 21 31 36 Labels are shortest paths fr