Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal E-Jurnal Matematika
LIKA HANIFA
Universitas Udayana
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP LIKA HANIFA; LUH PUTU IDA HARINI; G.K. GANDHIADI
E-Jurnal Matematika Vol. 14 No. 3 (2025)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/MTK.2025.v14.i03.p485

Abstract

A graph is a diagram that contains specific information.  One concept in graphs that can solve real-life problems is the concept of trees, which consists of various types of trees used to solve problems in life, such as finding the minimum path using the Dijkstra algorithm and the use of minimum spanning trees using the Sollin algorithm. This research produced the minimum path using Dijkstra's Algorithm and the minimum spanning tree using Sollin's Algorithm, which were applied to historical tourist routes in Sumenep Regency.
Co-Authors G.K. GANDHIADI LUH PUTU IDA HARINI