What my teacher teach for whole semester I can learn over a night on RUclips. Why the hell I am paying my semester fee, Instead I should pay for high speed broadband.
I've been almost a month learning it and still don't understand what it is. Now you can make me understand in 3 minutes. I love you and thank you. God bless you!!
Excuse me for using your top comment, but I have to let people see this: Sorry, but this algorithm is incomplete and not capable of solving a problem that my professor gave me. It works for the simplest matrices, but that's that. As a proof try to solve this exercise as said in the video: find the shortest route from f to c. The matrix is: . a b c d e f a 0 2 4 0 0 5 b 9 0 0 7 5 0 c 4 3 0 8 0 0 d 0 3 9 0 0 6 e 6 0 0 5 0 0 f 0 5 0 6 3 0 The solution should be 13 (f-e-a-c) but with this algorithm you will never obtain it.
There is an error in this explanation, I actually learnt the base of the algorithm here since the explanation is very simple and I came to find that it wasn't completely right. The error is when he says that we choose the edge with the minimal cost in order to visit a certain node, that's not the case, we have a list of the unvisited nodes and from all those nodes, the algorithm says that the next node to be visited is the node with minimal TOTAL distance to the origin, remember every visited node tries to update the adjacents nodes. You wrote this a long time ago, but I hope new viewers don't fall for the same mistake I did when I only based in this explanation.
It's crazy the fact that a 3 min video teaches me way better than a 1 hour class video of my teacher. Why do teachers always struggle with teaching in a simple way?
Someone who can actually take on Siraj Rival's mantra of learning something in 3 minutes lol. Very well explained, especially for someone who has seen this before but needed a quick refresher. Thanks so much!
This is great! Short, simple and very easy to follow. I like that you've made the pictures beforehand and don't draw freely during the video. Liked and subscribed :)
I've been watching hours of lecture videos talking about these and haven't understood them until your 2-3 minute videos! Thanks! Much less stressed now.
Alter Geile Meile ich bin die Ganze Zeit am versuchen die Funktion Anhand meiner Vorlesungsmaterialen zu verstehen und komm 0% vorwärts ... Ich gehe auf RUclips schaue mir ein 3 Minuten Video and und verstehe es direkt! Vielen Dank!! Das Video is sau stark !!!
most Teachers in Uni are so focused on proving the algorithm works, and is the best way to do 'X' - to the point they dont notice, or care, if the students even understood what the algorithm does or even supposed to do. thank you
Wait THAT’S Dijkstra’s Algorithm???? OHHHHHHHHH It makes so much sense now that I heard it described in normal English rather than whatever they were yapping about in the lecture hall lmaoo😅
I believe there might be an error in your results at 2:09. Shouldn't the path sequence be A -> C -> B -> E -> D, instead of both B -> E and B -> D? Following the A -> C -> B -> E -> D route results in a total cost of 7, rather than the cost of 8 that was concluded. Could you please verify this?
The point is to get the shortest distance from A to each other node. You seem to be thinking that the point is that the sum of the weights in the end graph he showed is supposed to be as low as possible, but that isn’t necessarily the case. Going from B to D is shorter than going from B to E and then D
Thanks a whole lot. However, from 1:41 why do we use the weight 3 instead of weight 1? That is the only thing I do not seem to understand. Thank you in anticipation of your response.
I don't understand what you're asking but one thing to keep in mind for others that might see your comment is that we add the value of the node you're in to the value of the node you want to go to and compare that result to the current value in your node list for the one you want to reach. If it's infinity then you place it but if it's equal or smaller than your sum then don't change it.
U need to keep track of the paths and not just the values leading up to the nodes. Dijkstra's algorithm gives you a path with a value, not just a value.
That's already been done in the video. You can obtain the shortest paths to each node by tracing the values in the "prev" Array/HashMap (shown in the pseudo code at the end).
I like these well-explained tutorials so much. If you don't mind, I would like to ask your permission to share these tutorials to the other website in China for the embarrassing reason that RUclips is blocked from accessing in China with translations. Of course, I will give sources of the original link. Appreciated.
Except for the pseudocode you forgot to mention the need of storing the predecessor node as well. This becomes clear very quickly when one tries to actually apply the algorithm as explained here - one would have to somehow memorize through which path a certain cost was achieved, but "somehow memorizing" is not what an algorithm should require.
Okay there is a bad misconception here. Select vertex w of which has smallest dist[w] among all unknown vertices. you do NOT base it off the edge, and you will always need to look at your chart to determine the next vertex.
![FNAF vs TF2 - Episode 2 [SFM]](http://i.ytimg.com/vi/z5b3V2-VLb0/mqdefault.jpg)
When you had an entire semester to study but you delay it till the last hour.
SO TRUE HAHAHA!!!!! lmao
On point ._.
气死我了，被抓包了
30 min*
So damn true, my exam is in twenty minutes lol.
I just learned more in that 3 minutes than the last 2 weeks of my programming class. Thanks a lot! :)
same lol
Fucking same, fuck uni teachers
same here :D
same here :D@@burstfireno1617
That's weird honestly
mikey, keep it up. you're cutting the other videos down by minutes - it's super efficient to study with you
James Clark Thanks, James. More coming soon.
An implication of Parkinson's Law.
Finally a clear, short and simple explanation :)
On behalf of everyone, thankyou and good job
What my teacher teach for whole semester I can learn over a night on RUclips. Why the hell I am paying my semester fee, Instead I should pay for high speed broadband.
what kinda teacher teaches dijkstra's algorithm for a whole semester?
@@ROFEL he meant everything his University or college covered in a semester,he is right though, sometimes
@@ramimxss s
There isn't anything you can't learn faster and more easily at home with the internet - all you need is motivation.
@@loot6 so true
I've been almost a month learning it and still don't understand what it is. Now you can make me understand in 3 minutes. I love you and thank you. God bless you!!
You just needed 7 minutes (actually less) to explain everything I did not understand in more than 3 hours! Thank you!
Excuse me for using your top comment, but I have to let people see this: Sorry, but this algorithm is incomplete and not capable of solving a problem that my professor gave me. It works for the simplest matrices, but that's that. As a proof try to solve this exercise as said in the video:
find the shortest route from f to c. The matrix is:
. a b c d e f
a 0 2 4 0 0 5
b 9 0 0 7 5 0
c 4 3 0 8 0 0
d 0 3 9 0 0 6
e 6 0 0 5 0 0
f 0 5 0 6 3 0
The solution should be 13 (f-e-a-c) but with this algorithm you will never obtain it.
worked for me
There is an error in this explanation, I actually learnt the base of the algorithm here since the explanation is very simple and I came to find that it wasn't completely right. The error is when he says that we choose the edge with the minimal cost in order to visit a certain node, that's not the case, we have a list of the unvisited nodes and from all those nodes, the algorithm says that the next node to be visited is the node with minimal TOTAL distance to the origin, remember every visited node tries to update the adjacents nodes.
You wrote this a long time ago, but I hope new viewers don't fall for the same mistake I did when I only based in this explanation.
but if that's the case where's his mistake? he always chooses the "cheaper" one realtive to the origin? or are you saying that his wording was poor?
I believe he's talking about the wording. The lack of explanation about how he did what he did for the sake of simplicity.
It's crazy the fact that a 3 min video teaches me way better than a 1 hour class video of my teacher. Why do teachers always struggle with teaching in a simple way?
A lot of them become teachers bc they’re really intelligent and hardworking, not because they’re actually good at teaching
@@BossKing1243 Can't agree more, most of them are good at doing research rather than teaching us
@@BossKing1243 Yup exactly.
Also classes move at the pace of the slowest learner. While videos go at superspeed, knowing you can just rewind a section you don't understand.
bro u save me just 13 hrs before my exam...
13 hours is a lot of time dude
nice now 3 years later i got an exam tomorrow. Hope i do really well.
Broo....
13 hrs. You're like a baby. Watch this
S I X H O U R S
Nice
Someone who can actually take on Siraj Rival's mantra of learning something in 3 minutes lol. Very well explained, especially for someone who has seen this before but needed a quick refresher. Thanks so much!
This is great! Short, simple and very easy to follow. I like that you've made the pictures beforehand and don't draw freely during the video.
Liked and subscribed :)
You're exactly the type of human the internet needs! Thank you!! :D
I've been watching hours of lecture videos talking about these and haven't understood them until your 2-3 minute videos! Thanks! Much less stressed now.
Getting ready for an interview and this is EXACTLY what I needed. THANK YOU!
hope you got selected
Update?
bro for the last two years I come back to this video every once in a while because I need it for a different class.. Thanks, you're awesome :D
You're a legend mate, 10 years later I'm studying for my HSC in NSW and this shi saved my life
💪🏼❤️
Alter Geile Meile ich bin die Ganze Zeit am versuchen die Funktion Anhand meiner Vorlesungsmaterialen zu verstehen und komm 0% vorwärts ... Ich gehe auf RUclips schaue mir ein 3 Minuten Video and und verstehe es direkt! Vielen Dank!! Das Video is sau stark !!!
Danke fürs zuschauen!
I showed up an hour late to class and missed the explanation for this. This 3 minute video explained everything I needed to know thank you!
This is actually legend. I searched up many long videos explaining it but only this short one helped me understand
EVERYONE explains this so hard this REALLY helped me thank you
This is like a quick revision during exams,Thank you .
do you mean review?
why tf do you have access to RUclips during exam
I felt so stressed for the exam coming in three days, and now I found your channel explaining everything so simply, thank you ❤
welcome! crush it
Thx! You helped me passing algorithm course exam last year, and I believe this video can help me passing the network course exam again!
Dude, I love you
You seriously need to make more videos about algorithm. They help me sooooo much. Thanks a lot
Thanks to you, I finished 4 different topics 1 hour before the exam 😀
Incredible video. Thank you you hero. So many videos of 20 minutes + that cannot get to the point.
💪🏼❤️
most Teachers in Uni are so focused on proving the algorithm works, and is the best way to do 'X' - to the point they dont notice, or care, if the students even understood what the algorithm does or even supposed to do.
thank you
Thank you! I fell asleep during my lecture, this was a lifesaver!!
Happens to the best of us 😴
These 2 min reviews are a god send! Final in 3 hours...
Simple and well explained. Thank you very much!
It would be really great if you could make a video for Bellman-Ford algorithm too.
thanasulas08111994 ***** Working on it now!
ruclips.net/video/obWXjtg0L64/видео.html
2024 here and you are a genius for explaining the algo so clear
I like how those videos are 2-3 minutes but it always take me 15+ minutes to watch them to the end
Short and sweet. We need more videos like this.
Even 8 years later you're still saving lives with this
My textbook never told me what "cost" was. It randomly started using that term. Thanks!
Thank you for this. There aren't enough truly concise videos out there, and I was getting desperate.
Wait THAT’S Dijkstra’s Algorithm????
OHHHHHHHHH
It makes so much sense now that I heard it described in normal English rather than whatever they were yapping about in the lecture hall lmaoo😅
best videos ever .... to understand data structure in few minutes ..
make more videos
..plz
It was the most useful 3 minutes in my life . Thank you.
Gonna have my final exam in 15 mins and I am here reivising the last topic taught in the lecture. Thanks!
I believe there might be an error in your results at 2:09. Shouldn't the path sequence be A -> C -> B -> E -> D, instead of both B -> E and B -> D? Following the A -> C -> B -> E -> D route results in a total cost of 7, rather than the cost of 8 that was concluded. Could you please verify this?
exactly my thought
It's meant to find the shortest distance to each node from A, not shortest distance in total.
The point is to get the shortest distance from A to each other node. You seem to be thinking that the point is that the sum of the weights in the end graph he showed is supposed to be as low as possible, but that isn’t necessarily the case. Going from B to D is shorter than going from B to E and then D
I really like your approach, concise and to the point
your videos are the best. Nobody wants to watch a 20 minute video just to pass their exam
Thanks a whole lot. However, from 1:41 why do we use the weight 3 instead of weight 1? That is the only thing I do not seem to understand. Thank you in anticipation of your response.
I don't understand what you're asking but one thing to keep in mind for others that might see your comment is that we add the value of the node you're in to the value of the node you want to go to and compare that result to the current value in your node list for the one you want to reach. If it's infinity then you place it but if it's equal or smaller than your sum then don't change it.
He doesn’t use weight 3. He adds 1 to the existing cost of first getting from A to C, which was 2. This gets you a total of 3 to get from A to B.
This explanation was awesome! So simple and concise. Thanks!
This psuedocode rendition is nice, compact, and readable. Much better than a lot of the other ones you see.
A nice condensed little video. Thank you.
you deserve a plenty of likes dude. i like how you shorten the video for us ❤️
OMG, finally all my semester can wrap up by approximately 3 minutes =)))
When you have 30 minutes before final semester exam but you didn't study at all
LMAO I'm here the day before my ALevel CS exam.
U need to keep track of the paths and not just the values leading up to the nodes. Dijkstra's algorithm gives you a path with a value, not just a value.
That's already been done in the video. You can obtain the shortest paths to each node by tracing the values in the "prev" Array/HashMap (shown in the pseudo code at the end).
thank to your video! That video is better than my professor's lecture
You're welcome, Huy! Thanks for watching.
Bro u truly are the best keep up 🔥
Watched it for an interview, when I went for the like button, I noticed that I already liked it, probably from my BSc years. I never learn 😂😂😂
Welcome back, and thank you for watching! Good luck on your interview.
i hope this comes clutch for me learning it from scratch for a semester exam tomorrow.
cool video series for a quick recap before the exams...
I'm confused @1:33 why did D and E change to one less than what they were before?
Thank you soomuch yaar you made my day much better
Thanks, Michael this video's very helpful.
unsw trimester is very busy, but thanks, you saved me a lot of time ~ ! ! !
I can't believe I just found the Holy Grail of RUclips channel for CS students
💪🏼❤️
my prof recommended me to watch this instead him teaching. not because he lazy but this explaination is just good
an algorithm my professor took 3 classes to explain and this dude didnt even need 3 minutes.
I like these well-explained tutorials so much. If you don't mind, I would like to ask your permission to share these tutorials to the other website in China for the embarrassing reason that RUclips is blocked from accessing in China with translations. Of course, I will give sources of the original link. Appreciated.
The best tutorial ever
It's such a perfect explanation.
Great video! Thank you so much for making it.
Very clear explanation. Thank you!
my man thanks for saving me time
michael you beautiful man you've saved me from an awful grade
Guess who's nearing the awful grade now :)
Concise and straight to the point. Thanks =)
thank you so much for this! Life changing
GOod..fantastic.It was like the fastest way..PErfect man keep it up!!!!!!
I have nothing against indian guys, they are smart and great people... But listening to an American English speaker is a pleasure to my ears.
Well, it is his first language... 😂
had to catch up after not going to a lecture, but i cant imagine how tf it took an entire lecture to explain this and one other algorithm
Exam in 1 hour, thanks for this!
Dear Sir Please do More videos and make them more simple and interactive and also add new Algos all of them!
This vid is the way I'm passing my Computer Networks class tmr
good , simple and clear explanation , thank you :D
Very great, thanks for your help!
My g saving people life right now
Great tutorial. Thank you very much.
I have my exam in 30 minutes this is perfect
You are such a king
Thanks for the excellent video: I now know how to pronounce Dijkstra!
thank you dude for saving my life :D
a truly inspired work 10/10
Except for the pseudocode you forgot to mention the need of storing the predecessor node as well. This becomes clear very quickly when one tries to actually apply the algorithm as explained here - one would have to somehow memorize through which path a certain cost was achieved, but "somehow memorizing" is not what an algorithm should require.
i wasnt sure wgat the differnce between this and bfs is. thank you so much!! 💅
Okay there is a bad misconception here. Select vertex w of which has smallest dist[w] among all unknown vertices. you do NOT base it off the edge, and you will always need to look at your chart to determine the next vertex.
thank you so much!!! You saved my life (again)
Awesome video thanks!
I passed algoritm class because this man
heck yeah
Are you sure about the time complexity? I believe it should be O((E+V)logV) (Did you forget the parenthesis?)
Thinking the same
Nice video. Please, just noticed a little typo : I believe the time complexity is O((|E| + |V|)log|V|) instead of O(|E| + |V|log|V|)
This is so good. Thanks!
Your videos are great!
thank you, straight to the point,
hey, ever thought about doing a video like this on the A* algorithm?