Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Polygon: Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Jurnal Ilmu Komputer dan Informatika
Juliana Gloria Br. Sipayung
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering Engineering Mathematics

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

Found 2 Documents
Search

 1 
Pengembangan Aplikasi Belanja Pintar Berbasis Linked List dengan Fitur Checklist dan Prioritas Juliana Gloria Sipayung; Dinda Syafitri; Muhammad Farrel Evan Yuri; Raja Ansel Haratama Sihombing
Jurnal Ilmu Komputer dan Informatika | E-ISSN : 3063-9026 Vol. 2 No. 2 (2025): Oktober - Desember
Publisher : GLOBAL SCIENTS PUBLISHER

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Shopping activities in daily life require proper recording to stay organized and efficient. Manual recording using paper or simple applications often creates difficulties when updates are needed, such as adding new items, removing purchased goods, or rearranging priorities. This study develops a web-based Smart Grocery List application utilizing the linked list data structure. The research stages were carried out independently, starting from idea planning, application design, system implementation, and testing to ensure proper functionality. The application provides core features such as item addition, item deletion, and categorization into immediate and later groups. The results show that the system works according to user needs, supports more systematic shopping list management, and has the potential to be developed further as a practical digital solution.
Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan Nazwa Salsyabilla Ramadhani; Juliana Gloria Br. Sipayung; Maria Winarni Br Silitonga; Mika Monika Fransiska Simanullang
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 3 (2026): Mei : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v4i3.961

Abstract

The increasing complexity of urban transportation systems demands intelligent and measurable navigation methods. Medan City, the capital of North Sumatra Province, has a dense road network with multiple route options that often confuse road users. Dijkstra's Algorithm, developed by Edsger Wybe Dijkstra in 1959, is a greedy-based computational approach proven effective for solving the shortest path problem on non-negative weighted graphs. This study applies Dijkstra's Algorithm to determine the shortest route from Medan Railway Station to Universitas Negeri Medan (UNIMED). The road network was modeled as an undirected weighted graph with 15 nodes and 16 edges, where edge weights represent actual road distances measured via Google Maps. The graph has a density of 0.152, confirming its sparse graph characteristic. Three alternative routes were identified and analyzed. The algorithm was implemented in Python 3 using the heapq module as a priority queue. Results show that the optimal route is A → B → C → E → F → M → N → O via Jl. M.T. Haryono, Jl. Aipda KS Tubun, Jl. Madong Lubis, and Jl. Prof. H.M. Yamin, with a total distance of 6.64 km. This achieves 99.1% accuracy compared to Google Maps, with a deviation of only 0.06 km. The optimal route is 6.25% more efficient than Alternative Route 1 (7.30 km) and 11.9% more efficient than Alternative Route 2 (7.54 km). The algorithm executes in under 1 millisecond with time complexity O((V+E) log V). These findings confirm Dijkstra's Algorithm as highly effective for medium-scale urban road network optimization.
Co-Authors Dinda Syafitri Maria Winarni Br Silitonga Mika Monika Fransiska Simanullang Muhammad Farrel Evan Yuri Nazwa Salsyabilla Ramadhani Raja Ansel Haratama Sihombing