Download to read offline
Uploaded byThahuraNaaz
158 views
Minimum spanning tree - Prims and Kruskal's algorithm
This document discusses a greedy algorithm for finding minimum spanning trees (MST) in graphs. It explains how Kruskal's algorithm works by sorting the edges by weight and building the MST by adding the lowest weight edge that does not create a cycle each iteration. The running time of Kruskal's algorithm is O(ElogE) or O(ElogV) for sparse graphs, making it very efficient.
Minimum spanning tree - Prims and Kruskal's algorithm
- 1. BET_ADA_3_Textbook_Greedy_MST Sunday, December 19,2021 7:26 AM General Page 1
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.