PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL

ABSTRACT: One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied inmany fields such as transportations problems and communication network design (Gruber and Raidl, 2005). MST begins from tree namely a connected graph has nocircuits. From the graph, there is a sub-graph that has all the vertex or spanning tree. Ifthat graph has the weight/cost, then the spanning tree that has the smallest weight/costis called Minimum Spanning Tree. Basic algorithm used to determine the MST is Kruskal’s algorithm. This algorithm is known as one of the best algorithms for theoptimization problems, especially for MST. In this paper is developed a source code program to determine MST using Kruskal’s algorithm and then implemented on several data representing a complete graph.
Keywords: Graph, Tree, Minimum Spanning Tree (MST), Kruskal’s Algorithm
Penulis: Swaditya Rizki
Kode Jurnal: jpmatematikadd120415

Artikel Terkait :

Jp Matematika dd 2012