I looked for so many videos on shortest path algorithms but couldn't understand anything. Finally, I came across your videos and they were really helpful! Thank you so much, sir!! :)
When first time I learned graph it was quite overwhelming, second time I discovered your playlist and graph became an addiction. Best part is all you algorithms are compatible with CLRS, so its easy to follow your video and CLRS at the same time. Thanks for the great content!
man!!, great videos, just after listening to your algorithm part of the video , I am able to code them without assistance. Great work man ,crystal clearity in mind.
I dunno y its not on top of list...maybe people are being selfish and not sharing good content and keeping to themselves..:( best ever explainations and codes :)))
I think in the section where it is explained including adjacent nodes would not affect the distance. It would affect in directed , but not in undirected . If d(u,u) via k = d(u,k) +d(k,u) + d(u,u). Now d(k,u) will be same as d(u,k) in non directed graphs.
very clear explanation amazing! sir please make a video on seralize and deserialize a binary tree if possible . the way u explain any problem is really amazing
Doubt: can't we use Dijkstra's algorithm to find the shortest path from node-0 to all other nodes. Then we can perform this for every other node. Since the time complexity for Dijkstra's algo is almost O(n×log(n)) and we run it 'n' times. Overall time complexity will be O(n×n×log(n)), which is better than O(n×n×n) in Floyd Warshall? Correct me if I'm wrong please.
Yaa we can find the same using dijkstra also. But Time comp of dij is ElogV. And for finding all pair shortest path using dijkstra it will become V*ElogV. And in worst case E can be V^2 . So time comp by using dijkstra will become V^3*logV (Floyd warshall having only V^3) . Secondly dij is not able to detect negative edge weight cycle. So one more plus point of Floyd warshall.
Hello Sir! I am in 4th year, As good and average companies have started their OFF-CAMPUS hiring, But i am not prepared.(Don't know algorithms, have basic knowledge about Data structures). Will be difficult for me to crack company's first coding round also.... I will give my best in September, and will cover most of the foundation. -MY QUESTION- 1.Should i wait this september and prepare myself, and start applying in companies in october? 2.Should i apply now, because only god knows, when will again companies post their job openings later in this year...? **KEEPING IN MIND, THAT MANY COMPANIES HAVE CRITERIA THAT..YOU CAN'T REAPPLY IN 6MONTHS/YEAR. Thanks
I would say keep preparing and keep applying. You will never be able to complete syllabus. It's never-ending. Even if you fail, you will have many other companies to apply. 6 months will be over in a flash when you are preparing seriously. So keep applying, keep preparing.
Thank u sir.. The way u explain is really awesome.. But I am at zero level in algorithm... Will you please tell me from where should I start or which book I follow... How should I increase my thinking level in dynamic programming... Please reply sir...
You should start with first reading editorials on easy level questions from geeksforgeeks and implement it. If you can do this then solve other easy level questions without looking at editorials.You will improve. Don't worry about DP in the beginning. First cover the important basic DSA and solve sufficient problems before moving to harder topics.
Sir when I apply the same for the first graph in your video, i get a matrix where all elements are zero except the top row, which displays '3' . Can you please tell me what is wrong with my code? Thank you for your help and advice. #include using namespace std; int main(){ int n; cin>>n; int e; cin>>e; int arr[n][n] = {INT_MAX,INT_MAX}; //for (int i=0;ix>>y>>dist; arr[x][y] = dist; } for (int w=0;w
![BLACK BAG - Official Trailer [HD] - Only in Theaters March 14](http://i.ytimg.com/vi/Du0Xp8WX_7I/mqdefault.jpg)
Thanks!
thank u sir.. now everytime when I want to learn a new algo, I would just search your video :)
Quite addictive ;)
So do I !😊...
love you sir ....❤️❤️
I looked for so many videos on shortest path algorithms but couldn't understand anything. Finally, I came across your videos and they were really helpful! Thank you so much, sir!! :)
Welcome 🤗
Sir you made everything so explicit and clear! I finally understood how it works! Thank you!
I always choose ur video over other utube video recommendations :D. You are such an awesome teacher.
Thanks
Best on youtube about Floyd Warshall.
Thanks
When first time I learned graph it was quite overwhelming, second time I discovered your playlist and graph became an addiction. Best part is all you algorithms are compatible with CLRS, so its easy to follow your video and CLRS at the same time. Thanks for the great content!
Welcome :)
your playlist is the best i watched all the videos from the begining amazing sir...
Thanks :)
You have made all graph algorithms understand very easy thank you soo much sir it means a lot...❤️🙏
Welcome :)
good explanation , 1 thing to add this algo can also be used to find transitive closure of the graph
man!!, great videos, just after listening to your algorithm part of the video , I am able to code them without assistance. Great work man ,crystal clearity in mind.
this much of quality content u have provided to people.very thanks a lot
Welcome :)
you explain better than my professor, thanks!!
😅
What an explanation! Understood in one go.
Thank you for your amazing explanation . I am so obsessed with your channel , I watch it on loop . Thank you !
Amazing , your way of teaching is so good! please make more videos on DSA topics.
What a Great Teacher 🙌
I am honored 😊
Hatsoff to your hardwork ! much appreciated
amazing sir , you make every explanation easy to understand.
Thanks :)
@@techdose4u please make a video on Optimal Strategy For a game using dynamic programming.
Didn't feel like a graph algo. You explained it so well.
Very well explained sir - thank for for sharing.
I dunno y its not on top of list...maybe people are being selfish and not sharing good content and keeping to themselves..:( best ever explainations and codes :)))
Thanks bro 😊 You can share 😁
It really is the best explanation I have found. This channel is the best! This dude has so much content too.
Clear and crisp explanation 👏👏
Thanks :)
God level explanation❤️
🤗
🤗
I think in the section where it is explained including adjacent nodes would not affect the distance. It would affect in directed , but not in undirected . If d(u,u) via k = d(u,k) +d(k,u) + d(u,u). Now d(k,u) will be same as d(u,k) in non directed graphs.
*_Excellent job, man!_*
Thanks 😊
very clear explanation amazing!
sir please make a video on seralize and deserialize a binary tree if possible .
the way u explain any problem is really amazing
Thanks. I will try when in start tree videos.
My face when I finally learned how it worked, after watching many tutorials, thanks to this tutorial: 😮
Thanks for your help ❤❤❤
great explanation!i just feel if you are bit more enthusiastic then the video can be the best!
19:52
Reminds me of Chand Nawab from Bajrangi Bhaijan XD
XDDDD
this shows how many retakes it take 🤣🤣🥲
Thank u for for the vid.
Can u tell what's the software u using for displaying slides?
Your videos never disappoint me 👌
Thanks :)
Amazing explanation 🥰😊. I like this algorithm
Thank you so much sir ❤️😍😇🙏🙏💕
Welcome :)
Can you put video for 0-1 knapsack problem
thank you sir😇
Doubt: can't we use Dijkstra's algorithm to find the shortest path from node-0 to all other nodes. Then we can perform this for every other node. Since the time complexity for Dijkstra's algo is almost O(n×log(n)) and we run it 'n' times. Overall time complexity will be O(n×n×log(n)), which is better than O(n×n×n) in Floyd Warshall?
Correct me if I'm wrong please.
Yaa we can find the same using dijkstra also. But Time comp of dij is ElogV. And for finding all pair shortest path using dijkstra it will become V*ElogV. And in worst case E can be V^2 . So time comp by using dijkstra will become V^3*logV (Floyd warshall having only V^3) . Secondly dij is not able to detect negative edge weight cycle. So one more plus point of Floyd warshall.
best explanation
Awesome content even for a person not using C++
Great sir you are awesome..Respect to you 🙏🙏🙏
Thanks bro :)
can we implement Floyd warshall using adjacency list representation of graph.?
Thanks Sir. Amazing explanation.
Welcome :)
If self loop is present in graph then what we do??
Remove self loops in preprocessing stage
Which application u r using for writing ?
This matrix give the shortest distance then how to find path
Hey Buddy, very nice explanation. Can I know what do you use to write and record?
Hello Sir!
I am in 4th year, As good and average companies have started their OFF-CAMPUS hiring, But i am not prepared.(Don't know algorithms, have basic knowledge about Data structures).
Will be difficult for me to crack company's first coding round also....
I will give my best in September, and will cover most of the foundation.
-MY QUESTION-
1.Should i wait this september and prepare myself, and start applying in companies in october?
2.Should i apply now, because only god knows, when will again companies post their job openings later in this year...?
**KEEPING IN MIND, THAT MANY COMPANIES HAVE CRITERIA THAT..YOU CAN'T REAPPLY IN 6MONTHS/YEAR.
Thanks
I would say keep preparing and keep applying. You will never be able to complete syllabus. It's never-ending. Even if you fail, you will have many other companies to apply. 6 months will be over in a flash when you are preparing seriously. So keep applying, keep preparing.
@@techdose4u thanks alot sir.
Noted
@@techdose4u this i the best advice, thankyou bhaiya
@@gouravgoel2974 welcome
Thank you
Awesome ✨
Thank u sir..
The way u explain is really awesome..
But I am at zero level in algorithm...
Will you please tell me from where should I start or which book I follow...
How should I increase my thinking level in dynamic programming...
Please reply sir...
You should start with first reading editorials on easy level questions from geeksforgeeks and implement it. If you can do this then solve other easy level questions without looking at editorials.You will improve. Don't worry about DP in the beginning. First cover the important basic DSA and solve sufficient problems before moving to harder topics.
@@techdose4u thanks sir
Welcome :)
ThxĄ
thanks bhai
Good morning
Good morning
Bro the out put is not coming btw the wxplaination was great i understood every single part but i don't know why out is not coming
Check your input. Sometimes assumed inputs get wrong.
great
Thanks :)
🙏
👍🏽
time complexity is same of djkstra & Floyd .
Definitely not!
That depends heavily on how it's implemented. The best way I know to lower the complexity is by using fibonacci heaps
Sir when I apply the same for the first graph in your video, i get a matrix where all elements are zero except the top row, which displays '3' . Can you please tell me what is wrong with my code?
Thank you for your help and advice.
#include
using namespace std;
int main(){
int n;
cin>>n;
int e;
cin>>e;
int arr[n][n] = {INT_MAX,INT_MAX};
//for (int i=0;ix>>y>>dist;
arr[x][y] = dist;
}
for (int w=0;w
Cool
:)
best explanation