Network Routing: Dijkstra's Algorithm

Поделиться
HTML-код
  • Опубликовано: 9 ноя 2024

Комментарии • 33

  • @anandseetharam
    @anandseetharam  Год назад

    I also blog on Medium medium.com/@seetharam.anand. I write on data science, AI, machine learning and computer science in general. Please FOLLOW me on Medium for more articles.I also provide FREE courses on Udemy on these topics www.udemy.com/user/anand-seetharam/. Check it out!

  • @purushothamreddy.j5613
    @purushothamreddy.j5613 3 года назад +15

    It would be better using cursor point while explaining examples.. hard to understand which way you are.. and the diagram is partially blocked.. unable to view properly.. apart from that teaching is so good.

  • @tomasvaladao8952
    @tomasvaladao8952 Год назад

    What an excellent video!

  • @chillplay8d655
    @chillplay8d655 3 года назад +3

    Great explanation, thank you.

  • @EEmui
    @EEmui 4 года назад +4

    Thank you! Could do my assignment with your explanation :)

  • @nchls5730
    @nchls5730 3 года назад +1

    Thank you

  • @aimenbaig6201
    @aimenbaig6201 3 года назад +1

    perfect explanation

  • @ezaldeen11
    @ezaldeen11 6 месяцев назад

    Could we apply the Dijkstra algorithm in MANET or do we need to apply Dijkstra algorithm with another protocol such as AODV to enhance it?

  • @abdullahmohammad5613
    @abdullahmohammad5613 3 года назад +1

    Excellent explanation, but please get closer to the mic, your voice is low!
    Other than that, Thanks for the informative content.

  • @furkan9198
    @furkan9198 4 года назад +4

    Hi, thanks for the video, do you have a pdf link for the example in the video?

    • @anandseetharam
      @anandseetharam  4 года назад +2

      Thank you for the positive comment. The slides are freely available on the web. Just search Kurose Ross slides on google.

  • @frankgeo3886
    @frankgeo3886 3 года назад +1

    Thank you :)

  • @takundamakoni3912
    @takundamakoni3912 4 года назад +2

    Hie..... I got a question, how do we deal with the case say for step 0 both D(w) and say D(x) where 3 ie more than one node had the shortest path?

    • @anandseetharam
      @anandseetharam  4 года назад +2

      If there is a tie, it can be broken arbitrarily.

  • @ushamechry961
    @ushamechry961 4 года назад +1

    Thank you so much

  • @ibrahimadiallo458
    @ibrahimadiallo458 2 года назад

    thanks

  • @SAymanShariff
    @SAymanShariff 2 года назад +3

    Use mike your voice is not audible and your diagram also half blocked, so correct it

  • @kshitij1397
    @kshitij1397 2 года назад

    Try to explain algorithm along with example...

  • @himanshutewari9530
    @himanshutewari9530 Год назад +1

    Itne ad kon dalta hai video mai, pdhna nhi hota h kya

  • @keerthiareddy
    @keerthiareddy 2 года назад +1

    distance from u to v is given 7, then why did you say for (10,v) the distance is 6+4? isn't it 7+4?

  • @PeaceComesDroppingSlow
    @PeaceComesDroppingSlow 2 года назад +1

    2 , to
    v , w
    It's very hard to understand when you utter these .

  • @Shadow-ro1nc
    @Shadow-ro1nc Год назад +3

    your speaking is kind of dangerous...try to calm down and speak normally...

  • @amoghladdagi7955
    @amoghladdagi7955 3 года назад +3

    I cannot understand u r video try to explain properly

  • @abinav1118
    @abinav1118 Год назад

    You should have given credits to the owner of the slides @JimKurose !!!!