007 Dijkstra Algorithm - Detailed Analysis
This video should give you a quick overview of It presents the first deterministic algorithm that beats the classical O(m + n log n) running time of 00:00 Intro 01:38 Change the lengths! 06:34 What is a good potential? 12:31 Implementation 16:20 Bonus Tom Sláma's video: ... This class discusses a fourth weighted single-source shortest path algorithm: 1:13 Algorithm prerequisites 1:55 Video outline 2:28
Photo Gallery

















