Network Routing: Dijkstra's Algorithm

แชร์
ฝัง
  • เผยแพร่เมื่อ 9 ม.ค. 2025

ความคิดเห็น •

  • @anandseetharam
    @anandseetharam  ปีที่แล้ว +1

    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 ปีที่แล้ว +18

    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 4 ปีที่แล้ว +3

    Great explanation, thank you.

  • @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.

  • @EEmui
    @EEmui 4 ปีที่แล้ว +4

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

  • @aimenbaig6201
    @aimenbaig6201 3 ปีที่แล้ว +1

    perfect explanation

  • @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.

  • @ezaldeen11
    @ezaldeen11 8 หลายเดือนก่อน

    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.

  • @himanshutewari9530
    @himanshutewari9530 ปีที่แล้ว +1

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

  • @kshitij1397
    @kshitij1397 3 ปีที่แล้ว

    Try to explain algorithm along with example...

  • @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?

  • @ushamechry961
    @ushamechry961 4 ปีที่แล้ว +1

    Thank you so much

  • @SAymanShariff
    @SAymanShariff 2 ปีที่แล้ว +3

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

  • @frankgeo3886
    @frankgeo3886 3 ปีที่แล้ว +1

    Thank you :)

  • @PeaceComesDroppingSlow
    @PeaceComesDroppingSlow 2 ปีที่แล้ว +1

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

  • @nchls5730
    @nchls5730 3 ปีที่แล้ว +1

    Thank you

  • @Shadow-ro1nc
    @Shadow-ro1nc ปีที่แล้ว +3

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

  • @ibrahimadiallo458
    @ibrahimadiallo458 2 ปีที่แล้ว

    thanks

  • @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 !!!!