
Chptr 10
Arac Algts 2—Gredy M hos
Objectives
After reading this chapter, you should understand
:
•
Greedy Strategy
:
Principles through examples
•
The terms
:
Objective functions, Optimality and Feasibility
•
Applicability and limitations of Greedy strategy
•
How choice of complex data structures infl uences algorithm complexity
•
The Union-Find Data Structure
•
Matroids
:
Properties and Applications
•
Minimum Spanning Tree Algorithms (Kruskal’s, Prims’s)
:
Correctness and Effi ciency
•
Shortest Path Algorithms (Dijkstra’s)
Chapter-10.indd 237Chapter-10.indd 237 8/9/2007 6:17:55 PM Sigma8/9/2007 6:17:55 PM Sigma