Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Bridge: Jurnal Publikasi Sistem Informasi dan Telekomunikasi Jurnal Ilmu Komputer dan Informatika
Muhammad Raihansyah Lubis
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.
Implementasi Algoritma Shortest Path untuk Optimasi Rute pada Sistem Navigasi Lokasi Sirlia Sahid; Maissy Angelica Pakpahan; Rifqi Putra Winanda; Muhammad Raihansyah Lubis; Adidtya Perdana
Bridge : Jurnal Publikasi Sistem Informasi dan Telekomunikasi Vol. 4 No. 2 (2026): Mei : Bridge : Jurnal Publikasi Sistem Informasi dan Telekomunikasi
Publisher : Asosiasi Profesi Telekomunikasi Dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/bridge.v4i2.841

Abstract

The increasing complexity of urban road networks demands intelligent navigation systems capable of determining optimal routes efficiently. This research implements the Dijkstra Shortest Path algorithm to optimize route search on a location navigation system in Medan City. The system models a road network as a weighted graph comprising 57 strategic locations and over 90 road connections, represented using adjacency list data structures. The Dijkstra algorithm, implemented in Python using the heapq module for priority queue management, achieves an optimal time complexity of O((V+E) log V). The system features five main functions: shortest route search, popular routes, location listing, dynamic location addition, and dynamic road connection addition. System testing using a case study from Kualanamu Airport to the University of North Sumatra (USU) yielded an optimal route of 16.5 km through 4 road segments. Results demonstrate that the system successfully determines the most efficient route, provides accurate distance and travel time information for multiple transport modes (motorcycle, car, walking), and presents step-by-step journey guidance. This research contributes as a practical reference for applying shortest path algorithms in urban areas and serves as a foundation for developing more complex navigation applications in the future.
Co-Authors Adidtya Perdana, Adidtya Farzad Sahnadi Pasaribu Maissy Angelica Pakpahan Mika Monika Fransiska Simanullang Rifqi Putra Winanda Sirlia Sahid