The document summarizes Kruskal's algorithm for finding a minimum cost spanning tree in a graph. Kruskal's algorithm uses a heap data structure to extract the lowest cost edge from the graph. It adds edges to the spanning tree only if they do not create cycles. This results in a minimum cost spanning tree being built incrementally. The document provides an example graph and shows the minimum cost spanning tree obtained using Kruskal's algorithm on that graph.