Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Conference SENATIK STT Adisutjipto Yogyakarta Compiler ComTech: Computer, Mathematics and Engineering Applications
Elizabeth Nurmiyati Tamatjita
Sekolah Tinggi Teknologi Adisutjipto
Aerospace Engineering Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Mathematics Mechanical Engineering

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

Found 2 Documents
Search
Journal : ComTech: Computer, Mathematics and Engineering Applications

 1 
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm Tamatjita, Elizabeth Nurmiyati; Mahastama, Aditya Wikan
ComTech: Computer, Mathematics and Engineering Applications Vol 7, No 3 (2016): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v7i3.2534

Abstract

Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm Elizabeth Nurmiyati Tamatjita; Aditya Wikan Mahastama
ComTech: Computer, Mathematics and Engineering Applications Vol. 7 No. 3 (2016): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v7i3.2534

Abstract

Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.
Co-Authors Ade Ari Ardianto Aditya Wikan Mahastama Agus Harjoko Anggraini Kusumaningrum Anggraini Kusumaningrum, Anggraini Angraini Kusumaningrum Ardianto, Ade Ari Bagus Pratama, Endyatna Puthut Bere, Gracelia Adelaida Brama Ady Sulistiyo Deni Fajar Pratama Dewi, Wahyu Sofyanti Dwi Nugraheny Dwi Nugraheny, Dwi Endyatna Puthut Bagus Pratama Gracelia Adelaida Bere Guruh Marindra Pratama Haruno Sajati Irawaty, Mardiana Kusumaningrum, Angraini Pratama, Deni Fajar Pratama, Guruh Marindra Ramdhani, Rio Rio Ramdhani Sulistiyo, Brama Ady Sumarsono Sumarsono Sumarsono Sumarsono Wahyu Sofyanti Dewi Yuliani Indrianingsih Yuliani Indrianingsih