MIT

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresNetworks and SecurityComputer ScienceScience & MathMathematics

Om kurset

Description: In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future. Instructors: Erik Demaine