Turnitin Floyd-warshall algorithm to determine the shortest path based on android
Date
2018-03-01Author
Ramadiani, Ramadiani
Darwis, Bukhori
Azainil, Azainil
Dengen, Nataniel
Metadata
Show full item recordAbstract
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.