MENENTUKAN MINIMUM SPANNING TREE PADA JARINGAN PLN DI KECAMATAN PADANG TIMUR KOTA PADANG

Iswan Rina, Dwi Sulistiowati, Ilham D Rianjaya

Abstract


Pada tulisan ini akan ditunjukkan penyelesaian data PLN dengan meminimumkan jarak  atau menentukan jarak terpendek dari data PLN, dengan kata lain mencari minimum spanning tree dari model tree yang terbentuk

AbstractIn this paper we will show the completion of PLN data by minimizing distance or determining the shortest distance from PLN data, in other words looking for a minimum spanning tree from the tree model formed
 

Keywords


Data PLN, Jalur Graf, Jarak terpendek, Algoritma menentukan jaringan terpendek

Full Text:

PDF


DOI: https://doi.org/10.15548/map.v1i2.1184
Abstract views : 258 times
PDF : 521 times

References


C.L. Liu. 1995. Dasar-dasar Matematika Diskrit Edisi Kedua. PT. Gramedia Pustaka Utama. Jakarta.

Fletcher, P, H, Hoyle and C. W. Patty. 1991. Foundation of Discrite Mathematics. PWS – KENT Publishing Company, Buston.

Munir, R. 2001. Matematika Diskrit Edisi Kedua. Informatika, Bandung.

Deo, Narshing. 1986. Graph Teory With Applications to Engineering and Computer Science, Prentice Hall, New Delhi.

Harary, Frank. 1969. Graph Teory. Addison – Wesley Publishing Company. Fhilipina.

Jhonsonbaugh, Richard. 2002. Matematika Diskrit Jilid 2. Prenhallindo. Jakarta.

Lipschutz, Seymoure and Lipson, Marc Lars. 2002. Matematika Diskrit 2. Penerbit Salemba Teknika. Jakarta.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 

Lisensi Creative Commonsis licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.