KRUSKAL AND PRIM ALGORITHM COMPARISON

Sugianto, Perry (2017) KRUSKAL AND PRIM ALGORITHM COMPARISON. Other thesis, Unika Soegijapranata.

[img]
Preview
Text
13.02.0106 Perry Sugianto COVER.pdf

Download (268kB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto BAB I.pdf

Download (60kB) | Preview
[img] Text
13.02.0106 Perry Sugianto BAB II.pdf
Restricted to Registered users only

Download (72kB)
[img]
Preview
Text
13.02.0106 Perry Sugianto BAB III.pdf

Download (59kB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto BAB IV.pdf

Download (286kB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto BAB V.pdf

Download (1MB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto BAB VI.pdf

Download (58kB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto DAFTAR PUSTAKA.pdf

Download (56kB) | Preview
[img]
Preview
Text
13.02.0106 Perry Sugianto LAMPIRAN.pdf

Download (139kB) | Preview

Abstract

Minimum spanning tree (MST) is used to solve graph problem. By using MST, lowest cost of graph can be determined. There are two algorithms that is commonly used in finding minimum spanning tree, such as Kruskal and Prim algorithm. Both of these algorithms can be used to find minimum spanning tree. However, these two algorithms have different method. In solving graph problem, it is important to know how each algorithm works, and learn is there any difference between these two algorithms. This project discussed about comparison of Kruskal and Prim algorithm and analysis of it. Both algorithms was tested on four different samples of graph. Then, each result would be compared. By making a comparison, it will be easier to understand how each algorithm works. Both Kruskal and Prim algorithm have same result in finding minimum spanning tree. This result proves that Kruskal and Prim algorithm already running correctly. Thus, both Kruskal and Prim are equally effective in finding minimum spanning tree. Keyword: minimum spanning tree, kruskal, prim. iv

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 005 Computer programming, programs & data > Information Systems
Divisions: Faculty of Computer Science > Department of Informatics Engineering
Depositing User: Mr Ign. Setya Dwiana
Date Deposited: 05 Dec 2017 07:51
Last Modified: 05 Dec 2017 07:51
URI: http://repository.unika.ac.id/id/eprint/15371

Actions (login required)

View Item View Item