Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Dijkstra's Algorithm and Probabilistic Analysis
Description
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 MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.