notesonly.in

One notebook for every subject — open it anywhere.

Log in

Spanning trees and minimum spanning trees

Graph theory · Mathematics

Study notes

Q: Triangle ABC: AB=1, BC=2, AC=3. Find the MST weight. Kruskal: sort edges 1, 2, 3. Take AB (1), take BC (2) - all vertices covered, n-1 = 2 edges. Skip AC (3): would form cycle ABC! MST weight: 1+2 = 3.

← Back to topics for Mathematics