DesignandAnalysisofAlgorithmsChapter8.pptVIP

Floyd’s Algorithm i j Vk-1 p Vk k p1 p2 dij(k)=min (dij(k-1), dik(k-1)+ dkj(k-1)) for k≥1 dil(k)=min (dil(k-1), dik(k-1)+ dkl(k-1)) for k≥1 solution for a smaller subproblem is used for getting solutions for multiple bigger subproblems l p3 Design and Analysis of Algorithms - Chapter 8 * In-class exercise What does dynamic programming have in common with divide-and-conquer? What is a principal difference between them? * * * * * * * * * * * * * * * * * * * * * * * Design and Analysis of Algorithms - Chapter 8 * Dynamic Programming Warshall’s and Floyd’sAlgorithm Dr. Ying Lu ylu@ RAIK 283: Data Structures Algorithms Design and Analysis of Algorithms - Chapter 8 * Giving credit where credit is due: Most of the lecture notes are based on the slides from the Textbook’s companion website /info/levitin Some of the notes are based on slides created by Dr. Philippe Laborie, ILOG and Mark Llewellyn, University of Central Florida. I have modified many of their slides and added new slides. RAIK 283: Data Structures Algorithms * Examples of dynamic programming algorithms Coin-row problem Computing binomial coefficients Longest Common Subsequence (LCS) Warshall’s algorithm for transitive closure Floyd’s algorithm for all-pairs shortest paths Some instances of difficult discrete optimization problems: 0-1 knapsack Design and Analysis of Algorithms - Chapter 8 * Warshall’s algorithm: transitive closure Computes the transitive closure of a relation (Alternatively: all paths in a directed graph) Example of transitive closure: 3 4 2 1 0 0 1 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 1 1 1 1 0 0 0 0 1 1 1 1 3 4 2 1 Design and Analysis of Algorithms - Chapter 8 * Warshall’s algorithm Main idea: a path exists between two vertices i, j, iff there is an edge from i to j; or there is a path from i to j going through intermediate vertices which are drawn from set {vertex 1}; or there is a path from i to j going through intermediate ver