cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nego Linuhung
Contact Email
aksioma.ummetro@gmail.com
Phone
-
Journal Mail Official
aksioma.ummetro@gmail.com
Editorial Address
-
Location
Kota metro,
Lampung
INDONESIA
AKSIOMA: Jurnal Program Studi Pendidikan Matematika
Published by Universitas Muhammadiyah Metro
ISSN : 20898703     EISSN : 24425419     DOI : -
Core Subject : Education,
Education Mathematics
AKSIOMA JOURNAL, e-ISSN: 2442-5419, p-ISSN: 2089-8703 is an information container has scientific articles in the form of research, the study of literature, ideas, application of the theory, the study of critical analysis, and Islāmic studies in the field of science Mathematics Education. AKSIOMA JOURNAL published two times a year, the period from January to June and July to December, published by the Scientific Publication Unit FKIP University of Muhammadiyah Metro.
Arjuna Subject : -
Articles 2 Documents
 1 
Search results for , issue "Vol 1, No 2 (2012)" : 2 Documents clear
PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL Rizki, Swaditya
AKSIOMA (Jurnal Pendidikan Matematika) Vol 1, No 2 (2012): JULI-DESEMBER (2012)
Publisher : UNIVERSITAS MUHAMMADIYAH METRO

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (286.363 KB)

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 in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005). MST begins from tree namely a connected graph has no circuits. From the graph, there is a sub-graph that has all the vertex or spanning tree. If that graph has the weight/cost, then the spanning tree that has the smallest weight/cost is 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 the optimization 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.
PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL Swaditya Rizki
AKSIOMA: Jurnal Program Studi Pendidikan Matematika Vol 1, No 2 (2012)
Publisher : UNIVERSITAS MUHAMMADIYAH METRO

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (286.363 KB) | DOI: 10.24127/ajpm.v1i2.68

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 in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005). MST begins from tree namely a connected graph has no circuits. From the graph, there is a sub-graph that has all the vertex or spanning tree. If that graph has the weight/cost, then the spanning tree that has the smallest weight/cost is 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 the optimization 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.

Page 1 of 1 | Total Record : 2

 1 

Filter by Year

2012 2012


Reset
Filter By Issues
All Issue Vol 14, No 3 (2025) Vol 14, No 2 (2025) Vol 14, No 1 (2025) Vol 13, No 4 (2024) Vol 13, No 3 (2024) Vol 13, No 2 (2024) Vol 13, No 1 (2024) Vol 12, No 4 (2023) Vol 12, No 3 (2023) Vol 12, No 2 (2023) Vol 12, No 1 (2023): [in press] Vol 12, No 1 (2023) Vol 11, No 4 (2022) Vol 11, No 3 (2022) Vol 11, No 2 (2022) Vol 11, No 1 (2022) Vol 10, No 4 (2021) Vol 10, No 3 (2021) Vol 10, No 2 (2021) Vol 10, No 1 (2021) Vol 9, No 4 (2020) Vol 9, No 3 (2020) Vol 9, No 2 (2020) Vol 9, No 1 (2020) Vol 8, No 3 (2019) Vol 8, No 2 (2019) Vol 8, No 1 (2019) Vol 7, No 3 (2018) Vol 7, No 2 (2018) Vol 7, No 1 (2018) Vol 6, No 3 (2017) Vol 6, No 2 (2017) Vol 6, No 1 (2017) Vol 5, No 1 (2016): JANUARI-JUNI (2016) Vol 5, No 2 (2016) Vol 5, No 1 (2016) Vol 4, No 2 (2015): Juli-Desember 2015 Vol 4, No 1 (2015): Januari-Juni (2015) Vol 4, No 2 (2015) Vol 4, No 1 (2015) Vol 3, No 2 (2014): Juli-Desember (2014) Vol 3, No 1 (2014): Januari - Juni 2014 Vol 3, No 2 (2014) Vol 3, No 1 (2014) Vol 1, No 2 (2012): JULI-DESEMBER (2012) Vol 1, No 1 (2012): JANUARI-JUNI (2012) Vol 1, No 2 (2012) More Issue