[Java] Dijkstra's algorithm | Solve Leetcode - Network Delay Time

In this video, I'm going to show you how to use Dijkstra's algorithm to solve a Leetcode problem - Network Delay Time.
Time Complexity = O(E + V^2) where:
V is the number of vertices
E is the total number of edges
In fact, I also have a whole section of solving leetcode questions and categorize them: czcams.com/users/EricProgram...
Here’s a quick rundown of what you’re about to learn:
Intro: (0:00)
Problem: (0:23)
Solution: (4:43)
Code: (12:27)
In the end, you’ll have a really good understanding on Dijkstra's algorithm and questions that are similar to Dijkstra's algorithm.
💻Code: github.com/Eric-programming/C...

[@firibuanyass]

I have started this whole series.From phase 1 to 6. The youtube algorithm should make this channel increase.Great job Eric

[@arghadeepsaha4981]

probably the best explanation for the problem on net

[@RiteshSingh-uz2qs]

I don't know why anyone has not commented on this. But this is a great explanation of the problem.

[@EricProgramming]

Thanks!

[@hhjdkdnchidnd]

some people's solutions do not use minheap, so that's make me confused sometimes. Your solution is pretty clear Thanks!

[@shashanksharma7747]

Good explanation

[@Yuser-zv1of]

what kind of drawer tool do you use? is it for macos?

[@techbarikcom]

Very good explanation

[@0xVantwoutMaarten]

I counted the word basically, you basically said 'basically', basically 500 times