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 GraphSearch.
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.