Dijkstra's Shortest Path Algorithm | Source Code | Graph Theory 

For anyone who struggled like me at 5:27 if(minValue > dist[nodeId]) continue; And then at 6:26 double newDist = dist[nodeId] +edge.cost thinking that since we are checking for minValue to be less than dist of node then hiw come we take the value in dist array without updating is: The line if(minValue > dist[nodeId]) continue; is redundant because every time we poll a value from the queue the value in dist array and minvalue are both same as while inserting to queue we also update dist with same value.. so thats why these both can be used interchangeably.

Demo with a main method please

I like the way you explain things with animation! Thank you for your videos! But when it comes to the code, everything is so bloated, poorly named, I just cant :(

Thanks for the fantastic video.

But why there is no main class in the code ?

i need this code for MATLAB please

Is this using matrix or list priority queue?

Thanks, son of Sackville.

Isn't the ipq.contains() method having O(N) time complexity?

awesome

DijkstrasShortestPathAdjacencyListWithDHeap Classic Java programmer XD