Studi Perbandingan Algoritma Prim, Algoritma Kruskal, Dan Algoritma Sollin Dalam Menentukan Pohon Merentang Maksimum
| Main Author: | Lubis, Ibnu Haris |
|---|---|
| Other Authors: | Tulus |
| Format: | Student Papers |
| Bahasa: | ind |
| Subjects: | |
| Online Access: |
http://repository.usu.ac.id/handle/123456789/28699 |
Daftar Isi:
- The result of this research is description of steps in determining minimum spanning tree by using four algorithms. Then is continued with comparative analysis out of the three algorithms. The result of this research indicates that the form of spanning tree and the number of weight spanning it is having equality for every weighted graph. What differentiates between Prim algorithm, Kruskal algorithm, and Sollin algorithm are different so algorithm the that number of steps applied by fourth of algorithms are different. For graph G with number of sides = 2(p - 1), algoritma Sollin is the most efficient and effectively compared to Prim algorithm, and Kruskal algorithm. For graph G with number of sides = 2(p - 1) but there is side having the same weight, Prim algorithm and Sollin algorithm are the most efficient and effectively compared to Kruskal algorithm. For graph G with number of sides < 2(p - 1), Sollin algoritma is more efficient and effectively compared to Prim algorithm, and Kruskal algorithm. For graph G with number of sides > 2(p - 1), Kruskal algorithm is the most efficient and effectively compared to Prim algorithm, and Sollin algorithm. Discussion about the maximum spanning tree admits of continued for research of maximum spanning tree other graphs type.
- 050803059