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
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.
This lecture covers the Bellman Ford algorithm for finding the shortest path in a graph, discussing the algorithm's implementation and its application in solving problems with negative edge weights. It also explores the concept of dynamic programming and the importance of detecting negative cost cycles in graphs.