DAA67:Minimum Spanning Tree Kruskal Algorithm | Kruskal's Algorithm Step by Step Explanation

Поділитися
Вставка
  • Опубліковано 29 лис 2024

КОМЕНТАРІ • 36

  • @MULTIPLEXER_ENCODER
    @MULTIPLEXER_ENCODER Рік тому +2

    Thank You Sir…..Aapne ek video mein sab samjha diya

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

    Thankyou so much sir,aap jo bhi samjhate hai acche se samjh aata hai,doston please sir ki videos ko jarur like kre, vo sach mae bohit mehent kr rahe hai😊

  • @GauravSingh-tq5vm
    @GauravSingh-tq5vm 2 роки тому +2

    Thank you sir apne ek video m he smjha diya thanks a lot

  • @smrjt9102
    @smrjt9102 5 років тому +8

    I thank u from the bottom of my heart sir for uploading all these recent topics related to Design and Analysis of Algorithm ( DAA ) lectures. As I was searching for all these topics the day before yesterday in your UA-cam channel but couldn't found one but today you've uploaded all these videos. Thank you Sir.

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

      Great keep watching and plz support my channels by spreading link of my channel to all social media profile.

  • @suyash.01
    @suyash.01 3 роки тому +4

    MST found at 18:50 is probably correct. The actual minimum spanning tree has a total weight of 29 and NOT 37.

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

    Sir you are better my daa teacher thank you sir

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

    (a,b) is missing in the set A. Probably ,sir forgot to add it in the set. So, 37 is correct

  • @manikumar9281
    @manikumar9281 7 місяців тому

    THANK YOU

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

    Thankyou sir best explanation 🔥🔥

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

    Thank you sor for daa teaching

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

    best explanation🙌

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

    edge bc and ah both have 8 value .
    can I connect ah instead of bc ?
    because it also gives right answer.
    please clarify..

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

      First and foremost the formation of min spanning tree should be given priority if it happens then we can do so.

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

      and yes after going through the question ..it can be achieved.

    • @vanshikarastogi9494
      @vanshikarastogi9494 10 місяців тому

      i also joined ah ....

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

    👍👍👍👍👍👍👍👍

  • @manishapanchal6997
    @manishapanchal6997 5 років тому

    Vry nice sir

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

    Thankyou Sir

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

    sir isme number of vertices and edegs are different which is not the property of a spanning tree

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

    🔥🔥🔥🔥

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

    🔥

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

    But iska programm kaha mileage 😢

  • @manishapanchal6997
    @manishapanchal6997 5 років тому +4

    Ye dislike kon krta h 👹