Closed Kemsekov closed 2 years ago
Kraskal's algorithm Just choose the shortest edges in whole graph where at least one end is free, then combine them in single tree
Done
Kraskal's algorithm Just choose the shortest edges in whole graph where at least one end is free, then combine them in single tree