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."
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.
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.
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
Legit saved me hours befor the exam. Thank you so very much. You have a new subscriber now!
Can't believe bro is saving us still 7 years later
Bro continues to save before finals. Thank you!
I watched prim's BFS dfs Kruskal's and dijk. You do way better than my professor. Subscribed . Thank you.
Thank you very much! I really appreciate that, more videos are on the way!
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."
yes you are right, dijkstra's can be used on both
Thank you! Your explanation is very simple, straightforward and easy to understand!
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.
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.
Excellent video, please do more.
Watching this video I realised that these algorithms are comprehendible! Thanks!!
best explanation ever..saves a lot of time ...keep going man
...make awesome videos like this..
:) thank you sir, i am going to upload more content
Your videos are fantastic.
thank you very much!
Very well explained ! Thank you !
thank you!
Great video, helped a lot, thanks.
Simply excellent.
thank you
great example
Good explanation
thank you
Nice work man :)
You are a miracle man
haha thank you
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' ?
why would you go back to s?
Wouldn’t be the shortest path if you go back to “S” you mug
what will be the relax function for Dijkstra Algorithm??
Can't see direction of edge of cost 6 between C and D.
Sir is an application of dynamic programming
I think edges need not be only directed...
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.