Graph Theory.
no cycles) and spans the graph at minimum cost → All MSTs of the graph has the same cost and are not necessarily identical. → Algorithms — Kruskal’s, Prim’s & Boruvka’s algorithm → Application — Designing the least cost network, circuit design, transportation networks, and several approximation