算法设计与chap9(greedy2014)重点解析.pptVIP

Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Prim’s Algorithm Initial Forest（n个单元素集合) Initial Forest Initial Forest Initial Forest(两个集合合并) 课堂小测验: （时间:15分钟) 已知有5个物品：(w1,w2,w3,w4,w5)=(3,2,1,4,5), (v1,v2,v3,v4,v5)=(25,20,15,40,50), 背包的容积W=6，请用动态规划方法求0/1背包问题的最优值。 1.只需求解出V[0:5,0:6]的前3行 2.请写出算法 Zhengjin,Central South University * Zhengjin,Central South University * Zhengjin,Central South University * Zhengjin,Central South University * Zhengjin,Central South University * Summary The greedy technique suggests constructing a solution to an optimization problem through a sequence of steps,each expanding a partially constructed solution obtained so far, until a complete solution to the problem is reached .On each step,the choice made must be feasible,locally optimal,and irrevocable. Prim’s algorithm is a greedy algorithm for constructing a minimum spanning tree of a weighted connected graph.It works by attaching to a previously constructed subtree a vertex closest to the already in the tree. Zhengjin,Central South University * Summary Kruskal’s algorithm is another greedy algorithm for the minimum spanning tree problem.It constructs a minimum spanning tree by selecting edges in increasing order of their weights provided that the inclusion doesn’t create a cycle. Dijkstra’s algorithm solves the single-source shortest-path problem of finding shortest paths from a given vertex (the source) to all the other vertices of a weighted graph or digraph.It works as Prim’s algorithm but compares path lengths rather than edge lengths.Dijktra’s algorithm always yields a correct solution for a graph with nonnegative weights. Zhengjin,Central South University * Any question? Zhengjin,Central South University * Homework Exercise 9.1: 7 Exercise 9.2：1,2, 5 Exercise 9.3: 1,2,3,5 * * For many problems, using dynamic programming to determine the best choice is an overkill. S