Discrete Math II - 11.5.1 Minimum Spanning Trees: Prim's Algorithm

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

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

  • @Xeyransa-us1lt
    @Xeyransa-us1lt 8 дней назад +1

    7:03 why you chose ab first despite the fact that there is edge with less weigh

  • @bmsmohammed4837
    @bmsmohammed4837 Месяц назад

    U have no idea how many times you’ve saved my life

  • @a.l9180
    @a.l9180 Год назад +2

    thank u so much i feel like i am ready for my exams cuz of u

  • @fts130
    @fts130 11 месяцев назад

    is it alright if i write edge de at 10:24 or it is a must to be ed cause my teacher did the same

    • @SawFinMath
      @SawFinMath  11 месяцев назад

      It’s the same edge, so it shouldn’t matter

  • @noitsnotme3911
    @noitsnotme3911 Месяц назад

    what book are you using?

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

    Teacher, why we must stop when n-1 edges have been added

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

      Each edge connects two vertices, and we only need enough edges to connect each vertex to another. So there will always be n-1. For instance, two vertices would have 1 edge. To connect 3 vertices, you only need 2 edges, and so on.