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.

КОМЕНТАРІ • 59

  • @darshmohi6338
    @darshmohi6338 3 роки тому +33

    Minimum resources
    maximum utilization
    Shows the efforts and creativity of the presenter.

  • @GuillaumeMaka
    @GuillaumeMaka 4 роки тому +5

    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,

  • @isabellelindblad2835
    @isabellelindblad2835 3 роки тому +22

    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.

  • @yashithayasanga9985
    @yashithayasanga9985 3 роки тому

    your effort is priceless...thank you so much...

  • @jayush8480
    @jayush8480 Рік тому +1

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

  • @acraf8408
    @acraf8408 4 роки тому +1

    The best explanation I found

  • @saqeebkhanpathan145
    @saqeebkhanpathan145 15 днів тому

    Mam very beautiful explanation thank u from hubbali Karnataka ❤❤

  • @QABhuvaneswariN
    @QABhuvaneswariN 2 роки тому

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

  • @sakshivaidya8701
    @sakshivaidya8701 3 роки тому +1

    your videos are really helpful ✨

  • @naineshrathod2392
    @naineshrathod2392 3 роки тому

    thank you very much, your videos are really helpful

  • @ilansuriyani2886
    @ilansuriyani2886 4 роки тому

    Mam your teaching way is superb

  • @usamasblog4965
    @usamasblog4965 4 роки тому

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

  • @alldogsgotoheaven1533
    @alldogsgotoheaven1533 2 роки тому

    Simple and easy 👏👏

  • @8dmusicstudio930
    @8dmusicstudio930 3 роки тому

    very helpful . Thanks a lot

  • @akashsinghchauhan721
    @akashsinghchauhan721 Рік тому

    *superb videos on graph DS Algo*

  • @ehtishamhussain9156
    @ehtishamhussain9156 Рік тому +1

    My favorite instructor award of the year 2022 goes to you Mam ❤❤

  • @auxodegaming5284
    @auxodegaming5284 3 роки тому +2

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

  • @ptlanju7020
    @ptlanju7020 2 роки тому

    Superb mam. Thank you

  • @debakibudha6796
    @debakibudha6796 4 місяці тому

    Your explanation soo amazing mam lots of love 💞❤

  • @pakinam190
    @pakinam190 3 роки тому

    explained very well

  • @harshdeeptelang127
    @harshdeeptelang127 3 роки тому

    great video

  • @abhinavsharma-xb5bq
    @abhinavsharma-xb5bq 5 років тому +10

    Hidden gem

  • @sethamankwah6512
    @sethamankwah6512 3 місяці тому

    Great presentation 👏👏👏👏

  • @whatidashdashdash8866
    @whatidashdashdash8866 4 роки тому

    Thanks a lot!

  • @amlff5214
    @amlff5214 3 місяці тому +3

    Your hand is so beautiful 😍

  • @LowescC
    @LowescC 2 роки тому

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

  • @jeongtwice9137
    @jeongtwice9137 Місяць тому

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

  • @mdtausifahmed6205
    @mdtausifahmed6205 3 роки тому

    you explain so well (:'

  • @merinpjose3524
    @merinpjose3524 3 роки тому

    thank you💞

  • @adduunweynaha4462
    @adduunweynaha4462 Рік тому

    Thank you.

  • @krackmawa9863
    @krackmawa9863 3 роки тому

    Thank you.....

  • @Abdul-jz6rr
    @Abdul-jz6rr 3 роки тому +1

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

  • @sathvikmalgikar2842
    @sathvikmalgikar2842 Рік тому

    thank you

  • @abhinavsingh595
    @abhinavsingh595 4 роки тому

    can you please explain this for undirect graph.

  • @Maximlitan
    @Maximlitan 3 місяці тому

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

  • @sharjeelkhan2578
    @sharjeelkhan2578 3 роки тому

    love u :*

  • @realaxis2562
    @realaxis2562 3 роки тому

    mam your voice. amazing

  • @perveashmohamed4893
    @perveashmohamed4893 2 місяці тому

    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

  • @Fact_with_manju
    @Fact_with_manju Рік тому

    Tq mam

  • @durgatammisetty6571
    @durgatammisetty6571 3 роки тому

    Plz say about floyd warshall algorithm mam

  • @mateen9366
    @mateen9366 Рік тому

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

  • @dheerajSharma-vb4cs
    @dheerajSharma-vb4cs 3 роки тому +24

    Your hands and voice are so nice..🙂🙂🙂

  • @ashusehrawat6769
    @ashusehrawat6769 4 роки тому

    woww

  • @ratneshsingh7726
    @ratneshsingh7726 Рік тому

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

  • @hruday4169
    @hruday4169 2 роки тому

    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 6 місяців тому

      The vertex which you have already visited

  • @celestialexploreryt
    @celestialexploreryt 2 роки тому

    thank you