Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Kruskal's algorithm

The usage of the algorithm

Report a typo

Kruskal's algorithm is used ...

Select one option from the list

... to find a minimum spanning tree in a weighted connected undirected graph.

... to find a maximal matching in a weighted connected undirected graph.

... to find all connected components in a weighted connected undirected graph.

... to find the shortest paths in a weighted connected undirected graph.

___

Create a free account to access the full topic