Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Kruskal's algorithm

Theory

The minimal phone cable

Report a typo

Imagine we have six cities that we want to connect in a single network:

What is the weight of a minimum spanning tree?

What is the weight of a minimum spanning tree needed to connect all the cities? Find such a tree using Kruskal's algorithm and choose its correct weight.

Select one option from the list
___

Create a free account to access the full topic