Dijkstra Algorithm
Вставка
- Опубліковано 12 тра 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.
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,
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.
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 very beautiful explanation thank u from hubbali Karnataka ❤❤
Tqq so much it is helpful for us. All the best . Rock well
your videos are really helpful ✨
thank you very much, your videos are really helpful
Mam your teaching way is superb
It really helped me alot. Thanks for saving my Exam....
:)
Simple and easy 👏👏
very helpful . Thanks a lot
*superb videos on graph DS Algo*
My favorite instructor award of the year 2022 goes to you Mam ❤❤
Thanks a lot love you a lot for saving from my exams😍
Superb mam. Thank you
Your explanation soo amazing mam lots of love 💞❤
explained very well
great video
Hidden gem
Great presentation 👏👏👏👏
Thanks a lot!
Your hand is so beautiful 😍
many thanks- I think I finally got it...
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 🤍🤍🤍❤️❤️
you explain so well (:'
thank you💞
Thank you.
Thank you.....
where can we search for more similar contents from the same teacher...?
thank you
can you please explain this for undirect graph.
Thanks for the great tutorial,
however, if we have numbers rather than letters on vertices, how could we deal with that?
love u :*
mam your voice. amazing
What if the previous unexplored path is greater than current taking path, should I stop the algorithm? Or else I go for next path
thanks
Tq mam
Plz say about floyd warshall algorithm mam
I wish she would be my algorithms teach. These engineering professors literally do what the book says.
Your hands and voice are so nice..🙂🙂🙂
😂😂
😂😂
....
Creep
Pervert
woww
No sound? Is it me or this video has no sound at all.
Thank you so much mam , tomorrow is my exam😅
kevin is saying you got a noiceeee voice
What is explored vertex?🙄
The vertex which you have already visited
thank you