Тёмный

Kruskal Greedy Algorithm 

barngrader
Подписаться 2,1 тыс.
Просмотров 2,7 тыс.
50% 1

Опубликовано:

 

6 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 7   
@loginid7108
@loginid7108 7 лет назад
Beautiful way to explain. Respect+
@OliverJoshuaJacob
@OliverJoshuaJacob 6 лет назад
Thanks. you're a great teacher.
@tothecloud_
@tothecloud_ 7 лет назад
BEAUTIFUL
@Mike-kq5yc
@Mike-kq5yc 4 года назад
What is the name of the book you are teaching of, that you mentioned on the beginning of the video?
@barngrader
@barngrader 4 года назад
I believe the book I was using at the time was "A Discrete Transition to Advanced Mathematics," by Richmond and Richmond. Here is a link to it on Amazon: www.amazon.com/Discrete-Transition-Advanced-Mathematics-Undergraduate/dp/0821847899
@AliHassan-ec9nu
@AliHassan-ec9nu 7 лет назад
what if more than one edge have minimum value.
@barngrader
@barngrader 7 лет назад
You can pick any of the equal edges and proceed to the next step; it will still work out to give you the minimum weight spanning tree.