G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3

Disclaimer: Please watch Part-1 and Part-2

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

[ishanshah]

this TC explanation is brilliant. have never seen such an amazing video of calculating Time complexity. This Graph series I've seen so far is definitely the best (I bet even any paid course wont be able to beat it ) and is on another level.

[JayPatel-snit]

Bro ne pura phd kar diya Time Complexity pe 😂.
Thanks bhai for such a nice explanation.

[CodeMode]

habibi tum time complexity mast samjai ho ....hum khush hui ..tum accha kaam karti

[abdulqadirboxwala]

this is a type of content that I would not give a second thought for even paying for it

[darkstudio]

Guys many of you having doubt that heap size is worst case V2 then while loop should also run V2 times. First of all, the assumption taken that Max Heap Size will be in worst case V2 is itself is wrong . Adding V2 node in any case is not possible. You can dry run, you will find that the distance condition wont allow V2 node to the queue in any case possible + the every node we will processed (pQ.poll()) wont be added to the queue again (you can marked those node vis also, wont have any effect on ans), In worst case heap size can go nV where n<<<V hence in both position we should take it as V not as V2. V(LogV+ELogV)==> VLogV(1+E)==> V^2 LogV==>ELogV. Period

[codinghustler]

I Understood this by your previous graph series. But from this it just make everything clear. Thank you Raj bhaiya for all of your effort.

[yatendraupadhyay]

Bhaiya you deserve Bharat Ratna for this quality content.

[GManiKarthik]

Such a brilliant and in-depth explanation of Dijkstra's Algorithm time complexity! As Striver said, I'm sure it took a lot of research to make it this clear. 🎩👏
❤❤Hats off, Striver! ❤❤

[sunny_]

This video just blew my mind.... Huge thanks Raj bhaiya... Now I am really willing to spend next 2-3 hours to concrete all the concepts on my own regarding this Dijkstra's Algo and shortest path.... "UNDERSTOOD"

[adityan]

I suspect that you're the creator of these Data Structures bro.... Just simply amazing... Love u bro. I succeded in one of the interviews because of u. This is because of you♥

[UCSSaloni]

00:00 Explaining Dijkstra's algorithm and why priority queue is used

01:58 Using a priority queue can save time in pathfinding

03:47 Optimize distance calculation by using minimal distance

05:40 Using priority queue to reach minimal nodes first reduces unnecessary exploration of parts.

07:25 The while loop runs for V, which is the total number of nodes.

09:16 Optimizing priority queue operations in graph algorithms

11:12 Pushing nodes in worst-case scenario results in V^2 Heap size

12:59 Explaining the time complexity of Dijkstra's algorithm

Crafted by Merlin AI.

[DHRUVBOHARA-zi]

immense amount of efforts put in by you!! hats -off raj bhaiya.

[algorithmsbyaditi]

You explained it really well ! I tried to understand it by reading a lot of blogs and discussions but was not able to but got your explanation. Thank you for this great great video.

[pavanpatel]

My god!!! What an exceptional explaination Striver!!, Hats off!! <3 ♥♥⭐⭐

[mdyousufgazi]

amazing. i really appreciate it how you explained the whole dijktra's algorithm. and the last part where you showed the the time complexity is O(E log V)

[ranjeet_sohanpal]

Seriously, you are the best. The deep work you did to become skillful is inspirational

[SmitShah-mm]

this is the top 1 rating video from my perspective for understanding of working flow time complexity throughout the code.

[niteshverma]

you are the best youtuber in the world for coding ♥♥♥♥♥♥

[parvmunjal]

This is the best explanation I have ever seen in my life. Thanks Striver :)