图 书 馆
讲座16：贪婪算法，最小生成树Lecture 16: Greedy Algorithms, Minimum Spanning Trees |
|
| 课程网址: | http://videolectures.net/mit6046jf05_leiserson_lec16/ |
| 主讲教师: | Leiserson Charles E |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2009-02-10 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | "OK, today we're going to start talking about a particular class of algorithms called greedy algorithms. But we're going to do it in the context of graphs. So, I want to review a little bit about graphs, which mostly you can find in the textbook in appendix B. And so, if you haven't reviewed in appendix B recently, please sit down and review appendix B. It will pay off especially during our take-home quiz. So, just reminder, a digraph, what's a digraph? What's that short for? Directed graph, OK? Directed graph, G equals (V,E), OK, has a set, V, of vertices... |
| 关 键 词: | 贪婪算法; 附录B; 有向图 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-05-22：吴雨秋(课程编辑志愿者) |
| 阅读次数: | 37 |