大三算法设计.pdfVIP

What we have known after previous learning… • Dynamic programming and its general diagram • Optimal substructure • The longest common subsequence problem • Matrix chain multiplication • The all-pairs shortest path problem • The knapsack problem Algorithms Design Techniques and ysis Contents of current chapter • Introduction of the Greedy Approach • The shortest path problem • Minimum cost spanning trees • Kruskal’s Algorithm • Prim’s Algorithm • File compression Algorithms Design Techniques and