Here is the pseudocode for Kruskal's algorithm:
- Sort all the edges in non-decreasing order of their weights.
- Initialize an empty minimum spanning tree.
- Iterate through all the edges in sorted order:
a. If adding the current edge does not create a cycle in the minimum spanning tree, add it to the tree.
- Repeat step 3 until all vertices are included in the minimum spanning tree.
This algorithm helps find the minimum spanning tree of a connected, undirected graph.
