算法讲稿3学习课件.pptVIP

Chapter 3 Greedy algorithm Section 3.1. What is greedy algorithm Section 3.2. Prim’s algorithm Section 3.3. Kruskal’s algorithm Section 3.4. Dijkstra’s algorithm Section 3.1 What is greedy algorithm (1) Optimization problems are classified into two categories : continuous optimization problems discrete optimization problems Section 3.1 What is greedy algorithm (2) What are discrete optimization problems? Given conditions: A set of objects S = {a1, a2, …, an}, a real value associated with each object ai, denoted v(ai). Goal: find an optimal object, i.e., an object with maximum (or m