Michael喜欢滑雪百这并不奇怪-公开课件.pptVIP

Objectives Greedy algorithm Dynamic Programming About Sequential Decision Processes Application of Dynamic Programming Conclusion Greedy algorithms Greedy algorithms work in phases. In each phase, a decision is made that appears to be good, without regard for future consequences E.g. Kruskal’s MST algorithm, Dijkstra’s algorithm Constructing Roads DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, o