Lecture
This lecture covers Dijkstra's algorithm for finding the shortest path in a graph with nonnegative weights, comparing it to Bellman-Ford and Prim's algorithms. It also introduces probabilistic analysis through the Hiring Problem, analyzing the expected number of hires over all candidate permutations.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace