Dijkstra's Algorithm: Shortest Path

Short Example of Dijkstra's Algorithm, If you guys would like an extended one with Time complexity and queue data structure please leave a comment in the description, when you update the vertex value to a smaller one is called relaxing an edge, something i forgot to mention in the video. Please subscribe for more.

[@zahrashaikh2153]

Legit saved me hours befor the exam. Thank you so very much. You have a new subscriber now!

[@SuPerStatic]

Can't believe bro is saving us still 7 years later

[@SY-uh8vs]

I watched prim's BFS dfs Kruskal's and dijk. You do way better than my professor. Subscribed . Thank you.

[@EducateYourselfNow]

Thank you very much! I really appreciate that, more videos are on the way!

[@karthik2454]

Great Explanation , please don't stop making videos , you are helping a lot of people.Liked and subscribed. Could you please make videos about Bellman Ford , Floyd , TSP and Knapsack as that would almost completely a mini-course.

[@EducateYourselfNow]

Thank you very much for your comment Neo, that means a lot to me. I will start making the suggested algorithm videos as soon as I can.

[@tomjosi742]

Good explanation, only comment i want to make is " it doesn't matter if the graph is directed or not. Dijkstra's algorithm simply references the adjacent vertices of a vertex."

[@EducateYourselfNow]

yes you are right, dijkstra's can be used on both

[@muhamadrifai3216]

Thank you! Your explanation is very simple, straightforward and easy to understand!

[@DiegoI-i9v]

Bro continues to save before finals. Thank you!

[@kvelez]

Excellent video, please do more.

[@saebzaidi]

Watching this video I realised that these algorithms are comprehendible! Thanks!!

[@vivekjm8524]

best explanation ever..saves a lot of time ...keep going man
...make awesome videos like this..

[@EducateYourselfNow]

:) thank you sir, i am going to upload more content

[@vineethm6930]

Simply excellent.

[@EducateYourselfNow]

thank you

[@markustorins384]

Your videos are fantastic.

[@EducateYourselfNow]

thank you very much!

[@Adam14789]

You are a miracle man

[@EducateYourselfNow]

haha thank you

[@numanalbakir2299]

Very well explained ! Thank you !

[@EducateYourselfNow]

thank you!

[@chinaguy101]

great example

[@suheladesilva2933]

Great video, helped a lot, thanks.

[@JairajJJ]

Good explanation

[@EducateYourselfNow]

thank you

[@sanket_valani]

Nice work man :)

[@AndayRubin]

Excuse me, why did you have to go back to B and look for another 'way' why not go back to S and look for another 'way' ?

[@EducateYourselfNow]

why would you go back to s?

[@V187-e7y]

Wouldn’t be the shortest path if you go back to “S” you mug

[@anui7466]

Sir is an application of dynamic programming

[@SF-fb6lv]

Can't see direction of edge of cost 6 between C and D.

[@sulemanali4006]

what will be the relax function for Dijkstra Algorithm??

[@raj-zo4ev]

I think edges need not be only directed...

[@EducateYourselfNow]

yes you can, good point, but most libraries expect a directed graph, unless you write your own, then you just need to keep track of them with an adjacency list.