Please use this identifier to cite or link to this item: http://repository.unmul.ac.id/handle/123456789/3415
Title: Floyd-warshall algorithm to determine the shortest path based on android
Authors: Ramadiani, Ramadiani
Buchori, Darwis
Azainil, Azainil
Dengen, Nataniel
Keywords: Floyd-Warshall, geographic information system, the shortest path
Issue Date: 8-May-2018
Publisher: IOP Conf. Series: Earth and Environmental Science 144 (2018) 012019
Series/Report no.: https://iopscience.iop.org/article/10.1088/1755-1315/144/1/012019/pdf;
doi :10.1088/1755-1315/144/1/012019;
Abstract: Abstract The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever get lost to a destination even to foreign places or that have never been visited before. The reasons why many institutions and business entities use technology to improve services to consumers and to streamline the production process undertaken and so forth. Speaking of the efficient, there are many elements related to efficiency in navigation systems, and one of them is the efficiency in terms of distance. The shortest distance determination algorithm required in this research is used Floyd-Warshall Algorithm. Floyd-Warshall algorithm is the algorithm to find the fastest path and the shortest distance between 2 nodes, while the program is intended to find the path of more than 2 nodes.
URI: https://iopscience.iop.org/article/10.1088/1755-1315/144/1/012019/meta
http://repository.unmul.ac.id/handle/123456789/3415
ISSN: Online ISSN: 1755-1315 Print ISSN: 1755-1307
Appears in Collections:A - Computer Sciences and Information Technology

Files in This Item:
File Description SizeFormat 
Floyd-warshall algorithm to determine the shortest path based on android.pdf1.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.