;
1.For
all vertices search the edge with the smallest weight of this vertex and mark these edges
2.Search
connected vertices (clusters) and replace them by a “new“ vertex (cluster)
3.Remove
the cycles and, if two vertices are connected by more than one edge, delete all edges
except the “cheapest“
Langkah I : Cari Nilai Minimun dari setiap sisi node
Langkah II : Pilih Node Terkecil yang telah dilirik
Langkah III : Hapus Sisi yang tidak terpilih
Langkah Ke IV : Hasil Minimum Spanning Tree
0 komentar:
Posting Komentar