# Exercise: Kruskal’s Algorithm

Test your understanding of Kruskal’s algorithm.

## We'll cover the following

## The task at hand

Given the graph in the playground below, grab a paper and a pen and identify the minimum spanning tree found by Kruskal’s algorithm.

You may verify your solution by clicking the “Run Kruskal’s Algorithm” button.

Note:

- You can also experiment on a different graph using these
instructions. instructions - If you choose to add a new edge, its weight will be generated randomly.
- If the automatically generated labels overlap with vertices or edges, you may view them more clearly by dragging the vertices of the given graph (after selecting the “Drag vertices” checkbox).

Get hands-on with 1200+ tech skills courses.