Skip to main content
Have a personal or library account? Click to login
Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm Cover

Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

Open Access
|Dec 2016

Authors

Bilqis Amaliah

bilqis@if.its.ac.id

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia

Chastine Fatichah

chastine@cs.its.ac.id

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia

Olyn Riptianingdyah

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia
Language: English
Page range: 2219 - 2236
Submitted on: Aug 16, 2016
Accepted on: Nov 14, 2016
Published on: Dec 1, 2016
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2016 Bilqis Amaliah, Chastine Fatichah, Olyn Riptianingdyah, published by Macquarie University, Australia
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.