tailieunhanh - Lecture Design and Analysis of Algorithms - Lecture 12: Greedy algorithms and minimum spanning tree

Lecture Design and Analysis of Algorithms - Lecture 12: Greedy algorithms and minimum spanning tree. The following will be discussed in this chapter: Optimal Substructure, greedy choice property, Prim’s algorithm, Kruskal’s algorithm. | Lecture Design and Analysis of Algorithms - Lecture 12 Greedy algorithms and minimum spanning tree

TỪ KHÓA LIÊN QUAN