Тёмный

Dijkstra Algorithm 

Lalitha Natraj
Подписаться 39 тыс.
Просмотров 133 тыс.
50% 1

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.

Опубликовано:

 

12 май 2019

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 57   
@darshmohi6338
@darshmohi6338 3 года назад
Minimum resources maximum utilization Shows the efforts and creativity of the presenter.
@isabellelindblad2835
@isabellelindblad2835 3 года назад
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.
@GuillaumeMaka
@GuillaumeMaka 4 года назад
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,
@jayush8480
@jayush8480 Год назад
This is the best video on this subject. Thank you Lalitha
@yashithayasanga9985
@yashithayasanga9985 3 года назад
your effort is priceless...thank you so much...
@acraf8408
@acraf8408 4 года назад
The best explanation I found
@ilansuriyani2886
@ilansuriyani2886 4 года назад
Mam your teaching way is superb
@usamasblog4965
@usamasblog4965 4 года назад
It really helped me alot. Thanks for saving my Exam.... :)
@akashsinghchauhan721
@akashsinghchauhan721 Год назад
*superb videos on graph DS Algo*
@QABhuvaneswariN
@QABhuvaneswariN 2 года назад
Tqq so much it is helpful for us. All the best . Rock well
@sakshivaidya8701
@sakshivaidya8701 2 года назад
your videos are really helpful ✨
@naineshrathod2392
@naineshrathod2392 3 года назад
thank you very much, your videos are really helpful
@ehtishamhussain9156
@ehtishamhussain9156 Год назад
My favorite instructor award of the year 2022 goes to you Mam ❤❤
@abhinavsharma-xb5bq
@abhinavsharma-xb5bq 5 лет назад
Hidden gem
@auxodegaming5284
@auxodegaming5284 2 года назад
Thanks a lot love you a lot for saving from my exams😍
@8dmusicstudio930
@8dmusicstudio930 3 года назад
very helpful . Thanks a lot
@alldogsgotoheaven1533
@alldogsgotoheaven1533 2 года назад
Simple and easy 👏👏
@debakibudha6796
@debakibudha6796 3 месяца назад
Your explanation soo amazing mam lots of love 💞❤
@sethamankwah6512
@sethamankwah6512 2 месяца назад
Great presentation 👏👏👏👏
@ptlanju7020
@ptlanju7020 2 года назад
Superb mam. Thank you
@whatidashdashdash8866
@whatidashdashdash8866 4 года назад
Thanks a lot!
@pakinam190
@pakinam190 3 года назад
explained very well
@harshdeeptelang127
@harshdeeptelang127 3 года назад
great video
@Abdul-jz6rr
@Abdul-jz6rr 3 года назад
where can we search for more similar contents from the same teacher...?
@LowescC
@LowescC 2 года назад
many thanks- I think I finally got it...
@jeongtwice9137
@jeongtwice9137 4 дня назад
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 🤍🤍🤍❤️❤️
@adduunweynaha4462
@adduunweynaha4462 Год назад
Thank you.
@mdtausifahmed6205
@mdtausifahmed6205 3 года назад
you explain so well (:'
@krackmawa9863
@krackmawa9863 3 года назад
Thank you.....
@Maximlitan
@Maximlitan 2 месяца назад
Thanks for the great tutorial, however, if we have numbers rather than letters on vertices, how could we deal with that?
@abhinavsingh595
@abhinavsingh595 4 года назад
can you please explain this for undirect graph.
@merinpjose3524
@merinpjose3524 3 года назад
thank you💞
@amlff5214
@amlff5214 2 месяца назад
Your hand is so beautiful 😍
@SupBee
@SupBee 2 года назад
thank you
@Fact_by_manju
@Fact_by_manju Год назад
Tq mam
@perveashmohamed4893
@perveashmohamed4893 Месяц назад
What if the previous unexplored path is greater than current taking path, should I stop the algorithm? Or else I go for next path
@thanosbs1763
@thanosbs1763 Год назад
thanks
@durgatammisetty6571
@durgatammisetty6571 3 года назад
Plz say about floyd warshall algorithm mam
@sharjeelkhan2578
@sharjeelkhan2578 3 года назад
love u :*
@ashusehrawat6769
@ashusehrawat6769 4 года назад
woww
@realaxis2562
@realaxis2562 3 года назад
mam your voice. amazing
@mateen9366
@mateen9366 Год назад
I wish she would be my algorithms teach. These engineering professors literally do what the book says.
@dheerajSharma-vb4cs
@dheerajSharma-vb4cs 3 года назад
Your hands and voice are so nice..🙂🙂🙂
@dheerajSharma-vb4cs
@dheerajSharma-vb4cs 3 года назад
😂😂
@chetanareddy2085
@chetanareddy2085 3 года назад
😂😂
@raht9578
@raht9578 2 года назад
....
@cross4326
@cross4326 2 года назад
Creep
@SubashKumarSK777
@SubashKumarSK777 10 месяцев назад
Pervert
@ratneshsingh7726
@ratneshsingh7726 Год назад
No sound? Is it me or this video has no sound at all.
@hruday4169
@hruday4169 Год назад
Thank you so much mam , tomorrow is my exam😅
@ratnadipsaha2527
@ratnadipsaha2527 Год назад
kevin is saying you got a noiceeee voice
@sdas1742
@sdas1742 3 года назад
What is explored vertex?🙄
@pranavJha93
@pranavJha93 5 месяцев назад
The vertex which you have already visited
@sathvikmalgikar2842
@sathvikmalgikar2842 Год назад
thank you
Далее
Dijkstra Algorithm - Example
13:04
Просмотров 143 тыс.
Prim's Algorithm
7:18
Просмотров 547 тыс.
КРУТОЙ ФОКУС С ШАРАМИ
00:35
Просмотров 322 тыс.
Dijkstra's Algorithm with example of undirected graph
12:31
How Dijkstra's Algorithm Works
8:31
Просмотров 1,3 млн
Suffix Tries
7:17
Просмотров 114 тыс.
Huffman Encoding
17:36
Просмотров 29 тыс.
Kruskal's Algorithm
4:33
Просмотров 504 тыс.