Aplikasi Algoritma Sollin dalam Pencarian Pohon Perentang Minimum Provinsi Jawa Tengah  

Oleh:

Anggraeni, Wulan

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - non-atma jaya
Dalam koleksi: Faktor Exacta: Jurnal Ilmiah Teknologi vol. 08 no. 04 (Dec. 2015), page 381-391.
Topik: graf; minimum spanning tree; algoritma sollin
Fulltext: FF3038108042015.pdf (663.65KB)

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: FF30 Non-tandon: tidak ada Tandon: 1

Lihat Detail Induk

Isi artikel

The purpose of this study is to find the minimum range tree of Central Java province by using sollin algorithm. This was research study by using literature study. Tree range minimum is a tree range which has minimum point from a graft. Looking for minimum range tree of Centre Java Province by using algorithm sollin with the solution by using matlab (matrix laboratory). Sollin algorithm is a combination between algorithm prim and kruscal. The way of working was choosing the left side from one point. Every point was identified. After identification process. Next step was checking cutset sides, and the most minimum cutset, so one tree with another tree was connected. After doing the identification by using algorithm sollin so it was got point of minimum tree range was 1251 km.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali