MENENTUKAN POHON RENTANG MINIMUM DENGAN ALGORITMA SOLLIN
| Main Author: | Ari Prastyo, Mamang |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2009
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/1426/1/MENENTUKAN_POHON_RENTANG_MINIMUM_DENGAN_ALGORITMA_SOLLIN.pdf http://eprints.umm.ac.id/1426/ |
Daftar Isi:
- Graph theory is one of the most important mathematic branch since it has application side and benefit in various knowledge and technology, by using algorithm or equation from graph theory, it would conclude the problem easier. One problem could be concluded by Graph theory was finding minimum spanning tree, that was finding the shortest distance to all points which didn’t form a circuit so that it would create an efficient network. A problem to be fulfilled should be found the right model. Then, after finding the model fit with the problem, we should find and use algorithm to conclude them. There was an algorithm could be concluded to find minimum spanning tree. One of them was Sollin algorithm. The determining of minimum spanning tree with Sollin algorithm started by making line on the sides from the heaviest height to the lighter, the next phase erasing sides in graph which didn’t connect the graph or making circuit so that creating a minimum distance tree. In this thesis, Sollin algorithm compared with Prim and Kruskal algorithm in deciding the minimum distance tree, so that found effectiveness level from the various algorithm. By finding each algorithm effectiveness, there could be found which the highest effectiveness algorithm. Discussion about Sollin algorithm could be found as alternative to decide the minimum distance tree outside Prim and Kruskal algorithms which were more popular. The using of Sollin algorithm in deciding minimum spanning tree could be applied in manual or computer program. But in the thesis, there used manual application involved points and line.