# Solution: Kruskal’s Minimum Spanning Tree

In this review, we give a detailed analysis on finding the minimum spanning tree of the given graph using Kruskal's algorithm.

## We'll cover the following

## Solution: Kruskal’s algorithm

Kruskal’s algorithm is a minimum-spanning-tree algorithm that finds an edge of the least possible weight.

It is a **greedy algorithm**, as it finds a minimum spanning tree for a connected weighted graph and adds increasing cost arcs at each step.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.