[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

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.

[firibuanyass]

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

[Sailgodgreenearth]

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

[arghadeepsaha]

probably the best explanation for the problem on net

[hhjdkdnchidnd]

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

[Yuser-zvof]

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

[xVantwoutMaarten]

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