I feel that this TH-cam channel has the potential to be one of the best competitive coding channels on entire TH-cam. Could you please organize all the videos of your channel into respective playlists ? Again thank you for your amazing service.
You're the ONLY one who actually showed me how to code Dijistra's algorithm. Everybody else (including my lecturers) just spent 20 minutes explaining how they would do it, how it works, but never got around to actually explaining correct how to do it. Ty so much! I have a working Dijkstra's algorithm now and I can begin studying this thing and utilizing it for my other projects. Thanks again!
I believe there's a small typo in the input values shown in the (commented) section of code. The image shown at 2:07 has no link from node 7 back to node 0. The inputs in the (commented) code at 2:10 have a value of '8' in [0][7] and [7][0]. According to the image, those should be '0'. Also, the values for [1][7] (value of '8') and [7][1] (value of '11') should be the same (the image shows there's a weight of '8' between nodes 1 and 7).
Great video man.Thank u for the video cuz it explains pretty much better as the other videos on YT were not code specific. 😁👍Glad to find your channel. Please guide and upload DS based code videos !!! Thanks Again.😘
Please consider uploading source code in next tutorials. It's a real hassle having to scroll through the video for finding one line. Other than that, perfect video!
Isn't is better to use a priority queue which has a time complexity of O(log n) removal and retrieval time instead of iterating through all elements to get a O(n) time complexity? If you would use a priority queue it would therefore run faster and where wouldn't be so much to code. Apart from that the video is pretty neat!
Your work helped me a lot in my DS assignment, but in the assignment my professor adding one condition that there is no loop, which confused me a little bit. I wonder if you can help me to explain it. btw, great video man!
nearest node means , that node which has the least distance (weight) from the current node. In dijkstra algorithm , in the first step , we are supposed to first get the nearest node that is not yet visited.
I feel that this TH-cam channel has the potential to be one of the best competitive coding channels on entire TH-cam. Could you please organize all the videos of your channel into respective playlists ? Again thank you for your amazing service.
Thank you so much
You're the ONLY one who actually showed me how to code Dijistra's algorithm. Everybody else (including my lecturers) just spent 20 minutes explaining how they would do it, how it works, but never got around to actually explaining correct how to do it. Ty so much! I have a working Dijkstra's algorithm now and I can begin studying this thing and utilizing it for my other projects. Thanks again!
Thank you so much. Do check out my dynamic programming deep dive series
beautiful
You literally saved me...I was crying because I didnt understand this for the lab exam...but now I get it..Thanks
the way you explained it , it took me just half an hour to code it ... respect
Thanks man 😁😃❤️
Wow bro this is a unique and different way of teaching, it just teaches dijkstra along with how to code, its very diff from other videos on yt
NIce work bro. I recently went over Dijkstra algo from my algorithms course but was having issues with the implementation. Thanks!
This is the best and easiest implementation which I have come across thus far!!
I believe there's a small typo in the input values shown in the (commented) section of code.
The image shown at 2:07 has no link from node 7 back to node 0. The inputs in the (commented) code at 2:10 have a value of '8' in [0][7] and [7][0].
According to the image, those should be '0'.
Also, the values for [1][7] (value of '8') and [7][1] (value of '11') should be the same (the image shows there's a weight of '8' between nodes 1 and 7).
Yeah it is an error!!
I am trying to correct this array.
Am I correct?
0 4 999 999 999 999 999 0 999
4 0 8 999 999 999 999 8 999
999 8 0 7 999 4 999 999 2
999 999 7 0 9 14 999 999 999
999 999 999 9 0 10 999 999 999
999 999 4 14 10 0 2 999 999
999 999 999 999 999 2 0 1 6
999 8 999 999 999 999 1 0 7
999 999 2 999 999 999 6 7 0
Great video man.Thank u for the video cuz it explains pretty much better as the other videos on YT were not code specific. 😁👍Glad to find your channel. Please guide and upload DS based code videos !!! Thanks Again.😘
Could u please upload the source code ???
Omg 🤩 thank you so much for your sweet words bro 😃 😃. Loved it :)
Sure , here is the source code link :
github.com/nateshmbhat/ada-lab-sit/blob/master/src/Greedy/Dijkstra%20algorithm/main.cpp
bilkul sahi kaha
You are talented bro!!!
I am an Aussie-Indian and have massive respect for such bright/smart Indian guys.
Not one care if youre aussie indian
i am a brightsmart indian guy
Please consider uploading source code in next tutorials. It's a real hassle having to scroll through the video for finding one line. Other than that, perfect video!
Yes, will add the source code now. Thanks :D
Output?
For your display function, on line 50, add
after cout
If you need the code to flush immediately after printing that, you could alternately use `std::endl`.
@@poCenilnO Both
and endl will work.
Isn't is better to use a priority queue which has a time complexity of O(log n) removal and retrieval time instead of iterating through all elements to get a O(n) time complexity? If you would use a priority queue it would therefore run faster and where wouldn't be so much to code. Apart from that the video is pretty neat!
yeah but it will increase insertion time
9:33
yes
How can I have my cost matrix be placed in the code already, and not needing the user to input it?
Thank you very much for this useful video
Hey, excellent work, when will you upload videos on all the algorithms like prims, pathfinding etc pls tell
Hi Tushar! Thanks. As of now I'm making videos on dp. But I definitely want to make vids on the topics you suggested too. Stay tuned. 😁🎉
Your work helped me a lot in my DS assignment, but in the assignment my professor adding one condition that there is no loop, which confused me a little bit. I wonder if you can help me to explain it. btw, great video man!
you can use priority queues
BS
Hi. When I put in the number of vertices - ->9, I don't get any output. Same code and all. Do you know what could be wrong?
same
Excelente tutorial, muy bien explicado
Why would you write C++ as if you write plain old C ?
Thank you very much for uploading very useful video. Keep doing, You are a very good instructor. Best of luck
Thanks so much man 😁
thank you, man
Nothing happens after I entered a cost matrix, the source code line isn't showing. How could I fix that?
I think you type "1" at the end.
Because this tells the program to start at the first "node"
i am not able to understand the ( int get Nearest) part.....plz explain......btw great video
nearest node means , that node which has the least distance (weight) from the current node. In dijkstra algorithm , in the first step , we are supposed to first get the nearest node that is not yet visited.
bro can u explain why in while loop parnode=parent[parnode];
Hi Adarsh. I have explained that in detail in my explanation video. Check it out. Link is in the description
wont we need the same header file for it to work'
yes im new and dont know much
do you still need help?
@@borgir6368 yo I need help
Those animations when typing and moving the cursor look so great, what extension for Visual are you using?
thats vim
gRaPhiCs
thanks bro
Actual G
very good
pro 👏👌
its fine sir good .....could u pls post a video for all k shortest path?
khud kr bay
How can I input the cost matrix?
this is so cool
Thanks 😇
which editor is it?
Vs code
so similar to Prim algorithm!
It didn't show the cost of 0 for 1
On line 50 change the code to
cout
That is very sad
Ye matrix chahiye
"NOTTOOO" MAAAAN. Hahaha
i think i just puked... that looks so hard