Repository Universitas Gunadarma >
E-Journal Teknologi Industri >
Please use this identifier to cite or link to this item:
|Title: ||THE APPLICATION OF SEARCHING THE SHORTEST PATH WITH DIJKSTRA ALGORITHM USING J2SE (Java 2 Standard Edition)|
|Authors: ||Citra Prigianti, Aditha|
|Issue Date: ||5-May-2012|
|Abstract: ||Path/the shortest path is the minimum path which is needed to achieve a place
from a particular place. This application can be used for the driver or delivery service
as the searching simulation of optimal distance, to get the efficiency of time, besides
that this application can be used by students who want to know the process of learning
about dijkstra algorithm which is used to search the shortest path.
This application will display the shortest path to get to a point desired by the
user. User can be flexible to determine the point and determine the respective segments
of each point with a certain quality. Results from this application are that it will display
the shortest path from the specified point and also the distance required to reach that
point. The purpose of this application is for the optimization of time and path to a point.
This application will be created using J2SE (Java 2 Standard Edition) language
|Appears in Collections:||E-Journal Teknologi Industri|
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.