Kruskal's Algorithm for Finding Minimum Spanning Trees

preview_player
Показать описание
An explanation of Kruskal's Algorith. Assumes prior knowledge of minimum spanning trees and disjoint sets.

Рекомендации по теме
Комментарии
Автор

How are you getting the negative when doing the unions? Like 0 and -2?

vicbits