In this lesson, we will learn about Dijkstra's algorithm, with a focus on following key points:
- What is Dijkstra's Algorithm?
- What are shortest path problems?
- See a working implementation of Djikstra's algorithm in Python
The field of computer science encompasses a wide variety of problems. The shortest path problem is an important one, and we see many applications of it daily.
For example, we often need to find the shortest path between two points while traveling. Web mapping applications such as Google Maps use these algorithms to display the shortest routes.
The shortest path problem can be solved using different algorithms, such as Breadth-First Search (BFS), A* search algorithm, or Floyd-Warshall algorithm. However, the most popular and optimal shortest path algorithm is the Dijkstra's algorithm.
