Penerapan Teori Graf Pada Jaringan Komputer Dengan Algoritma Kruskal

Fajar Mahardika

Abstract


Graph theory a branch of mathematics that studies graphs of a problem that arises. Problems related to graph theory include electricity grid planning, water networks, computer networks and so on. In this graph theory, many of the methods studied include Minimum Spanning Tree (MST). This MST method is used to determine a minimum of a graph.  In this MST there is an algorithm which is a kruskal algorithm. This kruskal algorithm is used to determine the shortest distance or minimum tree of a graph. The author conducted several trials related to the algorithm to be used. The author also conducts literature studies to determine the existing problems. In this study, choosing graph theory on a computer network with the algorithm used is the kruskal algorithm. In this study the authors conducted several stages such as hypotheses, trials and results. The results of this study are graph theory can be applied to computer networks, the number of devices needed can be known and in this experiment the algorithm gives a very maximum total used.


Full Text:

References


B. I. Ketut, Teori Graph dan Aplikasinya. Surabaya: Unesa University Press, 2007.

A. Gagarin, S. Hussain, and L. T. Yang, “Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks,” J. Parallel Distrib. Comput., vol. 70, no. 9, pp. 975–982, Sep. 2010.

S. Tao, L. Xiuzhi, W. Yanyan, C. Yanli, and C. Dayin, “A matlab simulation of the kruskal algorithm for erecting communication network,” in 2011 International Conference on Electronics, Communications and Control (ICECC), 2011, pp. 41–43.

B. F.F, “Implementasi Algoritma Kruskal Dalam Pengoptimalan Perencanaan Panjang Kabel Listrik (Studi Kasus PT.PLN Rayon Gombong),” STMIK Amikom Purwokerto, 2017.

H. Li, W. Mao, A. Zhang, and C. Li, “An improved distribution network reconfiguration method based on minimum spanning tree algorithm and heuristic rules,” Int. J. Electr. Power Energy Syst., vol. 82, pp. 466–473, Nov. 2016.

M. Abrori and N. Ubaidillah, “Pengujian Optimalisasi Jaringan Kabel Fiber Optic Di Universitas Islam Indonesia Menggunakan Minimum Spanning Tree,” J. Fourier, vol. 3, no. 1, p. 49, Apr. 2014.

H. D. L. Stanly and X. M. Fransiskus, “Algoritma Kruskal Untuk Menentukan Rute Terpendek Pada Jaringan Komputer,” J. Ilm. Mustek Anim Ha, vol. 3, no. 3, 2014.

R. Vivit Wardah, “Kolaborasi dan graf komunikasi artikel ilmiah peneliti bidangmpertanian: studi kasus pada jurnal penelitian danmpengembangan pertanian serta indonesian Journal of Agricultural Science,” J. Perpust. Pertan., vol. 17, no. 1, pp. 10–21, 2008.

F. Mahardika and H. Marcos, “Penerapan Algoritma Graf Welch Powel Pada Penjadwalan Mata Kuliah Dan Jadwal Asisten Study Kasus Forum Asisten STMIK Amikom Purwokerto,” Simetris J. Tek. Mesin, Elektro dan Ilmu Komput., vol. 8, no. 2, p. 825, Nov. 2017.

S. Melwin, Pengantar jaringan komputer. Yogyakarta: Penerbit ANDI, 2005.

S. Andi and G. Dhani, “Memilih Topologi Jaringan Dan Hardware Dalam Desain Sebuah Jaringan Komputer,” Inform. Pertan., vol. 16, no. 2, pp. 1037–1053, 2007.

T. L. Tambunan, “Pengoptimalan Jaringan Distribusi Air Dengan Menggunakan Algoritma Kruskal Pada Perusahaan Daerah Air Minum (PDAM) Tirtanadi Cabang Tuasan,” UNIMED., 2012.

S. M.P, Petunjuk Praktis Untuk Peneliti Pemula. Yogyakarta: Gadjah Mada University Press, 2004.

Sugiyono, Metode penelitian pendidikan:(pendekatan kuantitatif, kualitatif dan R & D). Bandung: Alfabeta, 2008.




DOI: http://dx.doi.org/10.30591/jpit.v4i1.1032

Refbacks



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

Terindeks oleh :

 

 http://ejournal.poltektegal.ac.id/public/site/images/informatika/Google_Scholar_logo.png

 

 

 

 

 

 

 

   ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Tim Redaksi JURNAL INFORMATIKA : JURNAL PENGEMBANGAN IT

Program Studi D4 Teknik Informatika
Politeknik Harapan Bersama Tegal
Jl. Mataram No.09 Pesurungan Lor Kota Tegal

Telp. +62283 - 352000

Email :
informatika.ejournal@poltektegal.ac.id

   

Copyright: JPIT (Jurnal Informatika: Jurnal Pengembangan IT) p-ISSN: 2477-5126 (print), e-ISSN 2548-9356 (online) 

Flag Counter
 
 
 
 
site
stats
 
View Visitor Statistic
 
 
 
 
 

 

Creative Commons License
JPIT (Jurnal Informatika: Jurnal Pengembangan IT) is licensed under a Creative Commons Attribution 4.0 International License.