Dijkstra Algorithm

preview_player
Показать описание
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.

darshmohi
Автор

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.

isabellelindblad
Автор

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,

GuillaumeMaka
Автор

Thanks a lot love you a lot for saving from my exams😍

auxodegaming
Автор

Your explanation soo amazing mam lots of love 💞❤

debakibudha
Автор

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 🤍🤍🤍❤️❤️

jeongtwice
Автор

This is the best video on this subject. Thank you Lalitha

jayush
Автор

What if the previous unexplored path is greater than current taking path, should I stop the algorithm? Or else I go for next path

perveashmohamed
Автор

Mam very beautiful explanation thank u from hubbali Karnataka ❤❤

saqeebkhanpathan
Автор

Thanks for the great tutorial,
however, if we have numbers rather than letters on vertices, how could we deal with that?

Learn-With-Omar
Автор

I wish she would be my algorithms teach. These engineering professors literally do what the book says.

mateen
Автор

where can we search for more similar contents from the same teacher...?

Abdul-jzrr
Автор

No sound? Is it me or this video has no sound at all.

ratneshsingh
Автор

Thank you so much mam, tomorrow is my exam😅

hruday
Автор

kevin is saying you got a noiceeee voice

ratnadipsaha
Автор

Plz say about floyd warshall algorithm mam

durgatammisetty
Автор

Tqq so much it is helpful for us. All the best . Rock well

QABhuvaneswariN
Автор

many thanks- I think I finally got it...

LowescC
Автор

It really helped me alot. Thanks for saving my Exam....
:)

usamasblog
Автор

can you please explain this for undirect graph.

abhinavsingh