Shortest Path in Weighted undirected graph | Dijkstra's | Why not BFS ? | Graph Concepts & Qns - 27

This is the 27th Video on our Graph Playlist.
Since we have studied Dijkstra's Algorithm, now it's time to brush it by solving problems on it.
In this video we will solve a very famous problem "Shortest Path in Weighted undirected graph".

We will understand today :
Why can't we solve it using BFS ?
What small modification needs to be done in Dijkstra's to solve this problem.

If you have been following my "Graph Concepts & Qns" playlist , then these will become very easy. Make sure to watch from the beginning of this playlist to master graph
in the easiest way possible.

Problem Name : Shortest Path in Weighted undirected graph
Company Tags : Flipkart, Microsoft
My solutions on Github : https://github.com/MAZHARMIK/Intervie...
GfG Link : https://practice.geeksforgeeks.org/pr...


My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie...
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish