G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------

[takeUforward]

Let's continue the habit of commenting “understood” if you got the entire video. Please give it a like too, you don't 😞

Do follow me on Instagram: striver_79

[awesome_latest_virals]

15:26 instead of assigning value using loop, we can just write vector<int> dist ( V, INT_MAX);

[visase]

Ahh Finally! Here it goes ... Happy to see you back after many days, was waiting for the new video graph playlist. Thanks a lot for your immense efforts Striver.
Good to see you in a new look! Virat Kohli of DSA! 😀

[ideepakpandey]

Wow, 3 videos on Dijkstra. We will not find such detailed videos even in expensive premium courses.

[suheabkhan]

Learning Dijkshtra algo for the first time... And understand it in the one watch was like unbelievable.. #striver op

[yezqhrr]

Striver bhaiya cant thank you enough...heard the concept and coded it on one go all credits to you🙏

[nikhilraj]

I have already solved more than 15 problems on Dijextra but i can't resist myself to watch whole video.

[amanasrani]

understood, we are so lucky to have u striver

[johnj]

love you man I will watch every second!!! love you for the dedication and series you have contributed for the community

[CodeMode]

Habibi ye bhi kamal video banti ... bahut accha bahut accha

[shivyanshgarg]

i like how i can write the code myself after being 5 - 6 mins in the video.

[sambhavagarwal]

understand Thanks a lot for your immense efforts Striver.

[dinushachathuranga]

excellent explanation. Lucky to find your channel.❤

[Moch]

Thank you!

I implemented it on my own and it worked without storing the distance on the priority queue. I only stored the nodes themselves. I also used a Pair class to store (dest, weight)

[cinime]

Understood! Super fantastic explanation as always, thank you very much!!

[rahulprasad]

bro this is the exact thing i was searching today

[vakhariyajay]

Thank you very much. You are a genius.

[raghavmanish]

thanku striver i have started this series from where i have stoped due to some reasons sure this time i will complete this

[SonuKumar-edbo]

17:20 We need to put the node in queue for same distanse too. So we need to put a equality sign over there

[unfamousgaayak]

U r doing a great job man . Salute to you ..