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
Mika Monika Fransiska Simanullang
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 
Implementasi Queue Berbasis Linked List Pada Aplikasi Web Manajemen Antrian Print Mahasiswa Sirlia Sahid; Farzad Sahnadi Pasaribu; Mika Monika Fransiska Simanullang; Muhammad Raihansyah Lubis
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

Queue irregularities are a common problem with photocopying services, particularly with student assignment printing. Because there is no clear system for managing the order in which documents are printed, students often have to wait long periods. This can lead to dissatisfaction and confusion. The purpose of this research is to create an interactive web application capable of managing routine print queues using a linked list-based queue structure. A queue system based on the FIFO (First In First Out) principle was created. This allows each student to enter their identity, the files to be printed, and any special notes about their printing needs. The system then displays a real-time queue list, allowing the photocopy operator to download the files in the correct order.
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 Farzad Sahnadi Pasaribu Juliana Gloria Br. Sipayung Maria Winarni Br Silitonga Muhammad Raihansyah Lubis Nazwa Salsyabilla Ramadhani Sirlia Sahid