+Comic Arena The difference is in the output and the purpose of the algorithms. Dijkstra's output is the shortest path while Prim's is a minimum spanning tree. D algorithm also explores only a part of the graph to get the solution. It is very important especially in the large graph as in Big Data environment. P algorithms give you the important aspects of the graph as well such as the coordinator or the hub.
I watched this explanation 2 days before my 3rd (and last) exam (Communication Networks). Needed a solid explanation about the algorithm since i couldn't understand my teacher's notes very well. Thank you for the visual walkthrough!
For those who were criticizing your language, I just want tell them that this is a mathematics session that means the objectives behind this session is only to solve such problem(shortest path) not to improve your language.
IntoTheSettingSky If e to z was '5', then we would not have updated z in last step since (10+5=15) > 14. In that case the shortest distance to z would have been 14 only with d as the predecessor of z.
Hi, I have a quick question, What if cd's weight is 4 instead of 8.? cost's at C would be b(2+1 =3), d (2 + 4 =6) and e (2+ 10 = 12). The algorithm still chooses b as its lowest at that point i.e 3 but, in this case the shortest path would be a-c-d-e-z = 11 and the algorithm would still choose the path with 13?? can you explain this condition what would happen?
After selecting B, we would evaluate the cost of going to D. First, let's set it equal to 8, because B is 3 and the edge (B,D) is 5. But, then we look at edge (C,D). The cost of that edge is now 4. 4 + the cost of C (2) = 6, so we change the cost of D to 6 and go there instead. Hope that helps!
You are referring to Hamiltonian circuit/cycle. It is an NP-complete problem. Please refer to more mathematical background before looking at the code. mathworld.wolfram.com/HamiltonianCycle.html
what if the first point is A and the last point is also A. You want to travel through all points only once and back to source? Do you know a solution for that?
what if edge "ez" have length 10,then you still have to choose vertex 'e' instead of vertex "z" because 'e' has low number compared to z but choosing z will give the shortest path.
Sir you made a great video, your video of dijkstra algo have biggest views(819k) as compare to any other video of din katra algo. Sir why have you stoped making videos pls make more videos these are really very helpful
How the fuck did you know it's exactly midnight and i have an exam tomorrow? D:
because he knows you're fucking procrastinator
TCP IP I don't even know this procrastinator guy, why would I be having sex with him? (see how much difference a simple 'a' can make in a sentence?)
The best comeback of the century!
same here
lmao exactly xD
Got to watch this video after midnight!! Have my end semester exam tomorrow!! Wish me luck friends...
+Abhilash Ramteke Dude can you tell me one thing? I find this and Prims algo almost same, Then what is the difference?
+Comic Arena Sorry boss. No idea.
+Comic Arena The difference is in the output and the purpose of the algorithms. Dijkstra's output is the shortest path while Prim's is a minimum spanning tree. D algorithm also explores only a part of the graph to get the solution. It is very important especially in the large graph as in Big Data environment. P algorithms give you the important aspects of the graph as well such as the coordinator or the hub.
+Abhilash Ramteke Tomorrow is my final
Ha, it's almost 5am here and I've got an exam tomorrow.
my midterm is also tomorrow, thanks to the kind people of youtube who uploads these videos.
Now it is my turn to watch it on Final exam's night.
wish me good luck and thank you.
Here I am, not like you guys, watching this video during while doing the Final exam!
LOL
u made my night (night before exam) xD
What a guy.
Madlads
Quarantine has blessed me with the same opportunity. :}
Thanks for the video, man. It's perfectly possible to understand your english. Haters gonna hate.
Excellent explanation. Short and accurate. Thanks mate.
I watched this explanation 2 days before my 3rd (and last) exam (Communication Networks). Needed a solid explanation about the algorithm since i couldn't understand my teacher's notes very well. Thank you for the visual walkthrough!
Great video with no mistakes. Keep up the good work 👍
I am so glad to say that I find the solution to the problem through you sir thank for helping
Thank you! You explain very fast and very clear!
Thank you very much! It was very well done. I've followed it now, much better than our lecturer.
this is your first time and you're alrdy good
TBH, he's totally right on the first comment. It is near midnight and I just started studying for my Discreet Math exam tomorrow...
Dear Professor, Thank you very much for your tutorial ......!!!
Precise and clear. Very helpful video. Thanks!
My first comment for any educational video on youtube :). Best video on the topic i found. Keep it up
Thanks for this video, it helped me understand it so easily compared to other videos.
For those who were criticizing your language, I just want tell them that this is a mathematics session that means the objectives behind this session is only to solve such problem(shortest path) not to improve your language.
Great video, helped me during the exam!!
Thanks in a million!!!! Santitham.
At the night of End Semester ... glad to watch .....
That was just awesome . So simple and clear. Thanks for the video . I hope you keep uploading them :)
good work. I like the video and understood also
a->c->b->d->e->z
I have a question: Once fixed "E", if the path-cost E-Z had been 30 instead of 3, what would have happened?
Thank you very much. Its great video. your english is perfectly fine. no worries.
Thank u bro. Its a great video. U explained this tough algorithm so easily .... N in a very shortcut way.
Thanks alot !!!!
good one... i understood it very well
Whoa! You can tell future! That's trippy man!
ur vedio is so good for study
thnks for uploading
The day after tomorrow the exam. Nice lecture.
Its almost 2022 and this video still helps 😄😊
Am I the only one watching this out of personal interest and not have an exam on this the next day?!
lol me too.
me too
im not
Yes yes you are
Me too
I have my mid-term exam at 1:30pm and I'm watching this video at 6:08am the same day
Thanks, at first you were hard to understand but now I get it :)
lol. That was my first time trying it as well.
Thanks man. To the point explanation
That was a very helpful video!
Buddy, exams over and now's the time to learn. Thanks
hey pls what t-series will do in 19 april
This helped me through. thank you alot buddy! :)
เข้าใจง่ายดีครับ ขอบคุณมากๆครับ กำลังทำรายงานอยู่เลย ^ ^
excellent explanation. keep it up!
Watching this after my Calculus exam... but hours before my Data Structures one.
Is this algorithm worsks on undirected graph also??
Don't have exam, but watching this cause I need this in my game design
Thank you!
This was a great explanation, I finally get it!
What if e to z was a "5" ... then what...does e still appear in the list of visited nodes?
IntoTheSettingSky If e to z was '5', then we would not have updated z in last step since (10+5=15) > 14. In that case the shortest distance to z would have been 14 only with d as the predecessor of z.
IntoTheSettingSky You visit e before you look at that number.
00:10 in South Africa, and I am writing on thursday😊
Thank you very very very much, it helped me a lot
Is this the sequential version or distributed implementation?
thank u......it is instant and farther halpfull for me
Nice video! What program do you use to make the graph?
So are there technically twice as many arcs, because there aren't any directional arrows?
it is indeed midnight before my exam
Thanks. It works perfect just like you said.
Good vid, very clear, thanks a lot!
Great tutorial dude
Watching just a night before final exam😀😀 wish me luck... Thanks
It's 2 AM and tommorrow at 7 AM i have exam so, thank you for enlightening me :)
guff thokyo prithivi le feri,haha,7 AM exam re.. :P
Brilliant, thank you!
How about adding arrows that show where each node is pointing to?
Hey having my end of sem next week anyway thank u...........appreciate
excellent.very helpful.thankyou.
Hi. For editing video, I used iMovie. But for creating it, I used S Notes and Screencast on the Galaxy Notes 10.1.
Nicely explained!
good job dude, you should put more up :)
thanks...doubts are cleared now :)
Hi, I have a quick question, What if cd's weight is 4 instead of 8.?
cost's at C would be b(2+1 =3), d (2 + 4 =6) and e (2+ 10 = 12).
The algorithm still chooses b as its lowest at that point i.e 3 but, in this case the shortest path would be a-c-d-e-z = 11 and the algorithm would still choose the path with 13??
can you explain this condition what would happen?
After selecting B, we would evaluate the cost of going to D. First, let's set it equal to 8, because B is 3 and the edge (B,D) is 5.
But, then we look at edge (C,D). The cost of that edge is now 4. 4 + the cost of C (2) = 6, so we change the cost of D to 6 and go there instead.
Hope that helps!
What will happen if edge e-z is 5? Will a-b-d-z be chosen as the shortest path?
ooohh my it seriously is midnight! thanks for the explanation by the way. ohh and i do have a final exam tomorrow!
Hi there,
What app did you use?
THX
thnks sir....incase while updating the cost, if the previous cost is lesser... so then no need to update,right?
the video is great. Thanku
How can you calculate the shortest path starting at A going through all of the nodes and returning at A? C++ or Java
You are referring to Hamiltonian circuit/cycle. It is an NP-complete problem. Please refer to more mathematical background before looking at the code. mathworld.wolfram.com/HamiltonianCycle.html
Thank you! This helped me quite a bit :)
What would we do if the cost of "d" is 8 , cost of "e" is 7 and "z" infinity? Would we move from a to c to e?
what if the first point is A and the last point is also A. You want to travel through all points only once and back to source? Do you know a solution for that?
You saved my life! Thank you so much xD
what if edge "ez" have length 10,then you still have to choose vertex 'e' instead of vertex "z" because 'e' has low number compared to z but choosing z will give the shortest path.
thank you that was rather helpful.
Thank you very much.
How did you record this video? It looks like you're using S Note on a Samsung Galaxy Note tablet.
It is just like you said. I used Screencast to capture the video screen of the old Samsung Galaxy Note tablet.
Thank you so much, so easy with your video :D
Should make a table, make it visually more clear
thank you so much
this method helped me a lot :)
thank you for this explanation
"hello students, it is already midnight"
me: no its not *looks at clock
me: OMG IT IS!!
good example my friend
great video! thanks! better than my professor lol.
If we get both value same.. Which one should be considered as minimum....
?
+VYOM JAIN any one..doesnot matter
Nice work
that was excellent thanks
Well done Buk-Lau
Sir you made a great video, your video of dijkstra algo have biggest views(819k) as compare to any other video of din katra algo. Sir why have you stoped making videos pls make more videos these are really very helpful
Thank you for this!
Thanks for the video :)
How do the sides 1,5 and 8 make a triangle?
Actually, how are any of those triangles possible?
Tech Aspiron They are not edges of a triangle, they are just costs of traversing a path. They've got nothing to do with triangles at all.
the shortest path is 13 e , can you list them due to the graph?