In this lesson, we will continue where we left off with Dijkstra's, and learn about other different shortest path algorithms. We'll have a focus on following key points:
- What are some other shortest path algorithms, other than
Dijkstra's algorithm? - How can we better understand
Bellman-FordandFloyd-Warshallalgorithms for shortest path problems. - Implementing these algorithms in Python.
In the previous tutorial, we saw how Dijkstra's algorithm can solve the problem of finding the shortest path between two points in a graph. But Dijkstra's is not the only algorithm that can solve this problem. In this tutorial, we will discuss two other famous algorithms for shortest path problems-- the Bellman-Ford algorithm and Floyd-Warshall algorithm.
Let's review some concepts from the previous tutorial before getting to the algorithms!
