Dijkstra Algorithm
Vložit
- čas přidán 12. 05. 2019
- Video 89 of a series explaining the basic concepts of Data Structures and Algorithms.
This video explains the working of the Dijkstra algorithm for finding shortest path in a weighted graph.
This video is meant for educational purposes only.
Minimum resources
maximum utilization
Shows the efforts and creativity of the presenter.
This is the most pedagogical video i have found on the subject so far, you finally made it click for me. Thank you, this wont be a problem im worrying about on the exam anymore.
Thanks you very much. Your clear explanation help me a lot to prepare my exam. My teacher took 1h to explain this and I barely understand it. And you within ~10 minutes you did it,
your effort is priceless...thank you so much...
This is the best video on this subject. Thank you Lalitha
The best explanation I found
Mam your teaching way is superb
thank you very much, your videos are really helpful
It really helped me alot. Thanks for saving my Exam....
:)
your videos are really helpful ✨
Tqq so much it is helpful for us. All the best . Rock well
*superb videos on graph DS Algo*
Thanks a lot love you a lot for saving from my exams😍
Hidden gem
very helpful . Thanks a lot
Simple and easy 👏👏
Your explanation soo amazing mam lots of love 💞❤
Your hand is so beautiful 😍
Thanks a lot!
Superb mam. Thank you
Great presentation 👏👏👏👏
explained very well
great video
many thanks- I think I finally got it...
Thank you.
My favorite instructor award of the year 2022 goes to you Mam ❤❤
thank you💞
Thank you.....
you explain so well (:'
where can we search for more similar contents from the same teacher...?
thank you
Thanks for the great tutorial,
however, if we have numbers rather than letters on vertices, how could we deal with that?
Thank you soo much for these many amazing videos we love u sis thnx a lot of helping students like us ! Akka we owe u a lot 🤍🤍🙌🏻tqu we love u 🤍🤍🤍❤️❤️
can you please explain this for undirect graph.
thanks
Tq mam
What if the previous unexplored path is greater than current taking path, should I stop the algorithm? Or else I go for next path
love u :*
mam your voice. amazing
woww
I wish she would be my algorithms teach. These engineering professors literally do what the book says.
Plz say about floyd warshall algorithm mam
Thank you so much mam , tomorrow is my exam😅
Your hands and voice are so nice..🙂🙂🙂
😂😂
😂😂
....
Creep
Pervert
No sound? Is it me or this video has no sound at all.
kevin is saying you got a noiceeee voice
What is explored vertex?🙄
The vertex which you have already visited
thank you