Minimum Spanning Trees with Prim's and Kruskal's Algorithms

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

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

  • @joseeduardo-th7zn
    @joseeduardo-th7zn 2 года назад

    wow, cant believe how helpful this was. thank you!

  • @nikoskalousis3523
    @nikoskalousis3523 Год назад

    Thank you so much!

  • @jesuscruz8008
    @jesuscruz8008 2 года назад

    amazing explanation thank you!

  • @mums2109
    @mums2109 3 года назад

    Thank you for this!

  • @asleepawake3645
    @asleepawake3645 3 года назад

    Great video!I think the TTL field should be in the IP header, so L3 routers can drop those packets, but Ethernet is susceptible to broadcast loops so L2 switches use other mechanisms like the spanningntree protocol to ensure the connectivity is dropped. BTW how does this compare to Djikstra's algorithm?

  • @zunkman1
    @zunkman1 Год назад

    6:47 - "I actually don't have any loops." Wanna' bet?????