Minimum Weight Spanning Tree (Kruskal's Method)

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

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

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

    me finding a math problem that I couldn't understand*
    then theres video from 8 years ago on my recommendation :

  • @Kira-lc4yg
    @Kira-lc4yg 2 года назад

    I hope this channel grow 🪴

  • @farzanalubna1852
    @farzanalubna1852 8 лет назад +4

    if i add c and d vertex .....thn it wont create cycle ....!! why u didn't add them ?

    • @senghji2794
      @senghji2794 8 лет назад +4

      because it's a 7. We have to pick the smallest value, i guess

  • @zibbamonster69
    @zibbamonster69 8 лет назад +4

    you might wanna explain the objective first. you know, like mention in the beginning that the goal is to visit each vertex ?

    • @vincevmw
      @vincevmw 8 лет назад +1

      +zibbamonster69 He did...