I really love the way you explained. I have been watching so many videos but none of them was good as yours. Thank you so much for saving me for my final that i have tomorrow 🙏🏻🤩
This is the millionth Dijkstra video I've watched and none of them have provided much context - they just launch in to the step-by-step, assuming quite a lot of prior understanding. I've coded working nav mesh mechanics since I was a teenager but my method of stepping through paths is cruder than I'd like it to be so I'm trying to figure out this method. There are so many questions I need answers to before the step-by-step even begins... such as: What results does this actually produce? Does it determine the shortest path from a source node to every other node in a single execution? Is the algorithm required once per node network / graph / map, once per node (since it plots to every other node), or once per node pair (pathfinding operation)? Is it dependant on a target node as well as a source node, or do the results provide enough info to plot the optimum course to any node from the source node?
"Visited" means it's done the connection checks from there. The starting point is the first node to be "visited". I gather that the next one that it "visits" is the one with the shortest connection to the one it's currently "at"... so it jumps around nodes like that, and rememberers where it's been so it can't go to the same node twice. When I say "it" jumps around nodes, I mean the algorithm's attention does. Like, it works from one node at a time... looking out towards nodes connected to the one it's working from.
I really love the way you explained. I have been watching so many videos but none of them was good as yours. Thank you so much for saving me for my final that i have tomorrow 🙏🏻🤩
Only one uploaded that one video cleared all doubts related to Dijisktra ...
Quick and crisp! good way to quickly solve djikistra
Video is short, percise and to the point. I was of much help.
Perfect explanation. Thank you. I have final exam in 15 minutes:D
Indeed a nice video to quickly revise the dijkstra algo!!👍
Behold " The Algo Terminator",, very short and precise 🙌
this was actually an easier way to solve . Thankyouu !
amazing explanation thank you!
Well simple to understand and very helpful tq so much...good job n continue doing more videos 👍❤️🎉
It was very helpful and quick😊😊
Nice sir but I dont undestood in last why are u taken weight of fourth node is 8 as it is
This is so soo good!! Please continue ur good work!!
It is really a very nice video👌👌👌
your teaching style is osm broo
Well explained... Please upload prims algo too..
great video sir ,keep uploading more ..
really nice way thanks a lot
Great explanation !! Thankss
What should we do if weight of two are same?
Thanks so much!
This is the millionth Dijkstra video I've watched and none of them have provided much context - they just launch in to the step-by-step, assuming quite a lot of prior understanding. I've coded working nav mesh mechanics since I was a teenager but my method of stepping through paths is cruder than I'd like it to be so I'm trying to figure out this method. There are so many questions I need answers to before the step-by-step even begins... such as: What results does this actually produce? Does it determine the shortest path from a source node to every other node in a single execution? Is the algorithm required once per node network / graph / map, once per node (since it plots to every other node), or once per node pair (pathfinding operation)? Is it dependant on a target node as well as a source node, or do the results provide enough info to plot the optimum course to any node from the source node?
OMG THANK YOU SO MUCH!
Very well explained! Video is really helpful :) Thanks!
Can a problem have an unvisited node or two left at last..??
Nicely explained !!😎
Gracias!
Well explained!
Bro u are amazing
Use pen not pencil because that is not clarity to see
But ur explanation is good
I'm not sure how you are defining visited.
"Visited" means it's done the connection checks from there. The starting point is the first node to be "visited". I gather that the next one that it "visits" is the one with the shortest connection to the one it's currently "at"... so it jumps around nodes like that, and rememberers where it's been so it can't go to the same node twice. When I say "it" jumps around nodes, I mean the algorithm's attention does. Like, it works from one node at a time... looking out towards nodes connected to the one it's working from.
Nice❤
clear samjha bhai ! nhi aya
its pronounced "DIEK-STRAS"
:):):):)