Minimal spanning tree (MST) nyambung kabeh vertex saka graf sing bobote lan koneksikupo kanthi total bobot sisi sing minimal lan tanpa siklus. Kruskal lan Prim minangka loro algoritma greedy klasik.
Kruskal (sortir sisi, union-find)
Sortir kabeh sisi miturut bobot; tambahaké sisi paling murah sing ora mbentuk siklus.
python
():
parent = ((n))
():
parent[x] != x:
parent[x] = parent[parent[x]]
x = parent[x]
x
mst, total = [],
w, u, v (edges):
ru, rv = find(u), find(v)
ru != rv:
parent[ru] = rv
mst.append((u, v, w)); total += w
mst, total