Dijkstra Algorithm Coding C++ | Shortest Path | Implementation | Graphs | Greedy

Поділитися
Вставка

КОМЕНТАРІ • 81

  • @teetanrobotics5363
    @teetanrobotics5363 4 роки тому +38

    I feel that this UA-cam channel has the potential to be one of the best competitive coding channels on entire UA-cam. Could you please organize all the videos of your channel into respective playlists ? Again thank you for your amazing service.

  • @saif0316
    @saif0316 3 роки тому +29

    You're the ONLY one who actually showed me how to code Dijistra's algorithm. Everybody else (including my lecturers) just spent 20 minutes explaining how they would do it, how it works, but never got around to actually explaining correct how to do it. Ty so much! I have a working Dijkstra's algorithm now and I can begin studying this thing and utilizing it for my other projects. Thanks again!

  • @biancaar8032
    @biancaar8032 11 місяців тому +1

    You literally saved me...I was crying because I didnt understand this for the lab exam...but now I get it..Thanks

  • @swrhsn6300
    @swrhsn6300 4 роки тому +3

    the way you explained it , it took me just half an hour to code it ... respect

  • @lac2275
    @lac2275 9 місяців тому

    NIce work bro. I recently went over Dijkstra algo from my algorithms course but was having issues with the implementation. Thanks!

  • @Tbm4545
    @Tbm4545 11 місяців тому

    Wow bro this is a unique and different way of teaching, it just teaches dijkstra along with how to code, its very diff from other videos on yt

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

    This is the best and easiest implementation which I have come across thus far!!

  • @poCenilnO
    @poCenilnO 4 роки тому +3

    I believe there's a small typo in the input values shown in the (commented) section of code.
    The image shown at 2:07 has no link from node 7 back to node 0. The inputs in the (commented) code at 2:10 have a value of '8' in [0][7] and [7][0].
    According to the image, those should be '0'.
    Also, the values for [1][7] (value of '8') and [7][1] (value of '11') should be the same (the image shows there's a weight of '8' between nodes 1 and 7).

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

      Yeah it is an error!!

    • @user-georgeisme
      @user-georgeisme Рік тому

      I am trying to correct this array.
      Am I correct?
      0 4 999 999 999 999 999 0 999
      4 0 8 999 999 999 999 8 999
      999 8 0 7 999 4 999 999 2
      999 999 7 0 9 14 999 999 999
      999 999 999 9 0 10 999 999 999
      999 999 4 14 10 0 2 999 999
      999 999 999 999 999 2 0 1 6
      999 8 999 999 999 999 1 0 7
      999 999 2 999 999 999 6 7 0

  • @aniket7512
    @aniket7512 5 років тому +7

    Great video man.Thank u for the video cuz it explains pretty much better as the other videos on YT were not code specific. 😁👍Glad to find your channel. Please guide and upload DS based code videos !!! Thanks Again.😘

    • @aniket7512
      @aniket7512 5 років тому +1

      Could u please upload the source code ???

    • @FriendlyDeveloper
      @FriendlyDeveloper  5 років тому +1

      Omg 🤩 thank you so much for your sweet words bro 😃 😃. Loved it :)

    • @FriendlyDeveloper
      @FriendlyDeveloper  5 років тому +2

      Sure , here is the source code link :
      github.com/nateshmbhat/ada-lab-sit/blob/master/src/Greedy/Dijkstra%20algorithm/main.cpp

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

      bilkul sahi kaha

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

    For your display function, on line 50, add
    after cout

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

      If you need the code to flush immediately after printing that, you could alternately use `std::endl`.

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

      @@poCenilnO Both
      and endl will work.

  • @mohnish.deshpande
    @mohnish.deshpande 4 роки тому +2

    You are talented bro!!!
    I am an Aussie-Indian and have massive respect for such bright/smart Indian guys.

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

      Not one care if youre aussie indian

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

      i am a brightsmart indian guy

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

    Please consider uploading source code in next tutorials. It's a real hassle having to scroll through the video for finding one line. Other than that, perfect video!

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

    Isn't is better to use a priority queue which has a time complexity of O(log n) removal and retrieval time instead of iterating through all elements to get a O(n) time complexity? If you would use a priority queue it would therefore run faster and where wouldn't be so much to code. Apart from that the video is pretty neat!

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

      yeah but it will increase insertion time

  • @Princess-ly9em
    @Princess-ly9em Рік тому +1

    Output?

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

    The best video I've seen so far.

  • @tusharjain4108
    @tusharjain4108 4 роки тому +4

    Hey, excellent work, when will you upload videos on all the algorithms like prims, pathfinding etc pls tell

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

      Hi Tushar! Thanks. As of now I'm making videos on dp. But I definitely want to make vids on the topics you suggested too. Stay tuned. 😁🎉

  • @kristoforo4178
    @kristoforo4178 4 роки тому +2

    Those animations when typing and moving the cursor look so great, what extension for Visual are you using?

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

    Thank you very much for this useful video

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

    Why would you write C++ as if you write plain old C ?

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

    How can I have my cost matrix be placed in the code already, and not needing the user to input it?

  • @kumaraditya1419
    @kumaraditya1419 4 роки тому +3

    i am not able to understand the ( int get Nearest) part.....plz explain......btw great video

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

      nearest node means , that node which has the least distance (weight) from the current node. In dijkstra algorithm , in the first step , we are supposed to first get the nearest node that is not yet visited.

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

    Excelente tutorial, muy bien explicado

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

    Your work helped me a lot in my DS assignment, but in the assignment my professor adding one condition that there is no loop, which confused me a little bit. I wonder if you can help me to explain it. btw, great video man!

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

    Thank you very much for uploading very useful video. Keep doing, You are a very good instructor. Best of luck

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

    bro can u explain why in while loop parnode=parent[parnode];

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

      Hi Adarsh. I have explained that in detail in my explanation video. Check it out. Link is in the description

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

    How can I input the cost matrix?

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

    Hi. When I put in the number of vertices - ->9, I don't get any output. Same code and all. Do you know what could be wrong?

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

    Nothing happens after I entered a cost matrix, the source code line isn't showing. How could I fix that?

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

      I think you type "1" at the end.

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

      Because this tells the program to start at the first "node"

  • @shrutiomatic
    @shrutiomatic 2 роки тому +2

    9:33

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

    wont we need the same header file for it to work'
    yes im new and dont know much

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

    which editor is it?

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

    its fine sir good .....could u pls post a video for all k shortest path?

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

    It didn't show the cost of 0 for 1

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

    Ye matrix chahiye

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

    pro 👏👌

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

    thank you, man

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

    so similar to Prim algorithm!

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

    thanks bro

  • @SzrIsTaken786
    @SzrIsTaken786 2 роки тому +1

    Actual G

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

    very good

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

    this is so cool

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

    "NOTTOOO" MAAAAN. Hahaha

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

    i think i just puked... that looks so hard