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.
Bellman Ford: Shortest Paths
This lecture covers the Bellman-Ford algorithm for finding shortest paths in a directed graph with edge weights. It explains problem variants like single-source, single-destination, single-pair, and all-pairs shortest paths. The algorithm iteratively updates shortest-path estimates and detects negative cycles. Runtime analysis and implementation details are discussed, along with an example and final comments on its applications in routing and dynamic networks.
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