Lecture 3: Greedy algorithms: Shortest path, minimum spanning tree (1)
About this video
Editorial review · 85% confidenceRound-9 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor) passed; strict per-title check + final strict pass; oEmbed verified.
A 47-minute video from Center on Frontiers of Computing Studies, PKU: “Lecture 3: Greedy algorithms: Shortest path, minimum spanning tree (1)”.
Video by Center on Frontiers of Computing Studies, PKU, played through YouTube's embedded player.