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

Dijkstra's Shortest Path Algorithm source code implementation in Java
Previous Video on Dijkstra's:
• Dijkstra's Shortest Pa...
Indexed Priority Queue Video:
• Indexed Priority Queue...
Algorithms repository:
github.com/williamfiset/algor...
Video slides:
github.com/williamfiset/Algor...
Personal website:
www.williamfiset.com
===================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: amzn.to/3wC2nix

[@hendelsrkearny]

Thanks for the fantastic video.

[@rashmidhant3364]

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.

[@petrotkach8757]

Yes, I think so too!

[@dhritishmansarmah2496]

awesome

[@11simonjr]

Demo with a main method please

[@user-go2yu4hq5p]

Is this using matrix or list priority queue?

[@zineddinebenkhaled5787]

But why there is no main class in the code ?

[@xqs329]

Thanks, son of Sackville.

[@chinmayjoshi4539]

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

[@nisheksharma7583]

no thats the beauty of PQ, think like you are searching an element in BST( PQ sort of uses the same kind)

[@AurelianoShowsTheWorld]

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 :(

[@WilliamFiset-videos]

Thanks for the feedback Aureliano, I think the long variable names have stumped others in the past too. I've made note of this and will try to be less wordy

[@sarmedal_bakri5751]

i need this code for MATLAB please

[@EidosGaming]

DijkstrasShortestPathAdjacencyListWithDHeap Classic Java programmer XD

[@lildhansenmadsi]

It's better than dspalwdh