Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Telematika : Jurnal Informatika dan Teknologi Informasi
Muhammad Alhan
Unknown Affiliation
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM Hadiyanto Hadiyanto; Muhammad Alhan
Telematika Vol 9, No 1 (2012): Edisi Juli 2012
Publisher : Jurusan Teknik Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31315/telematika.v9i1.294

Abstract

Determination of the minimum spanning tree are widely used to solve optimizationproblems of finding solutions to problems that require minmum. In the electricity distributionnetwork, minimum spanning tree (MST) is used to find the minimum length of cable forelectricity network system becomes more optimal. Minimum weight of a MST primarydistribution power network is strongly influenced by the geographical conditions of a region inthe form of contour data. This research was done by designing a model of primary distributionpower network graph in accordance with the data obtained. In finding the minimum weight foreach side of the network graph should include parameters elevation, high point / node, and thedistance between points / nodes. Furthermore, the graph is done by computer calculation andsimulation to get the electricity distribution network primary MST using Prim's algorithm with thehelp of ArcView GIS 3.3 program through the avenue script.Prim's algorithm included in the category of good or efficient algorithms, because theshape of polynomial time complexity in n, where n is a measure of the number of vertices orsides. Based on the test results have shown that the algorithm Prim MST ability to determinethe primary distribution grid is much better if based on the geographical conditions of a region.In addition, Prim's algorithm graph computation time in generating the MST based on the datathat is not based on the contour and contour data are quadratic.Keywords: minimum spanning tree, prim's algorithm, contours, complexity time
Co-Authors Sudarno Sudarno Sunaryo Sunaryo TATI NURHAYATI Yaya Finayani