MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM

SUSIANI, ERNA (2009) MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM. Other thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
MEMBANGUN_POHON_MERENTANG_MINIMUM_DENGAN_MENGGUNAKAN__ALGORITMA_PRIM.pdf

Download (49kB) | Preview

Abstract

Graph is the method of discrete problem solution searching that was in the real world. Graph has much of concepts. The ones is Tree concept. Tree concept is being the significant and the popular concept because support to applies graph for a lot of branch of science. The application that use tree concept such as road away built project and railway track built project, built a computer network, etc. Tree is graph with undirected and connected. Being present graph with tree concept to solve problem by building graph become Minimum Spanning Tree. One of the algorithm which is used to built Minimum Spanning Tree is Prim algorithm. Prim algorithm is one of algorithm which is used to decide Minimum Spanning Tree from weighted graph and connected graph. Prim algorithm forms Minimum Spanning Tree step by step. Prim algorithm explores much of selection in every steps and product at least one Minimum Spanning Tree

Item Type: Thesis (Other)
Subjects: L Education > L Education (General)
Divisions: Faculty of Teacher Training and Education > Department of Mathematics and Computing
Depositing User: Anggit Aldila
Date Deposited: 03 Jul 2012 02:59
Last Modified: 03 Jul 2012 02:59
URI: http://eprints.umm.ac.id/id/eprint/10659

Actions (login required)

View Item View Item