In this video, you will understand everything about #Dijkstra's #Algorithm. We will be discussing the dijkstra algorithm for single source shortest path. In single source shortest path, we have to find the shortest path from source to all other vertices in the given graph. If we consider the brute force algorithm, it takes O(V*V) so we have moved to the greedy approach i.e. Dijkstra Algorithm which will give us the best possible solution.
In this video we have discussed the following:
1) What is Single Source Shortest Path?
2) What is Dijkstra Algorithm and why it is used?
3) Working of Dijkstra Algorithm.
4) Time Complexity of Dijkstra Algorithm.
5) What are the Limitations of Dijkstra Algorithm?
Previous Year GATE Questions on Dijkstra Algorithm: https://youtu.be/LQma2mL40gA
You can connect with us on Facebook, links are given below:
Facebook_Page: https://www.facebook.com/suregatesuccess
Facebook_Group: https://www.facebook.com/groups/34348...
#Subscribe_Us for more such videos.
Keep supporting keep learning
BEST OF LUCK 👍
