UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

Shortest Path Trajectory System Based on Dijkstra Algorithm

Putri, Indah Pratiwi (2012) Shortest Path Trajectory System Based on Dijkstra Algorithm. Masters thesis, Universiti Utara Malaysia.

[img] Text
INDAH_PRATIWI_PUTRI.pdf
Restricted to Registered users only

Download (2MB)
[img]
Preview
Text
INDAH_PRATIWI_PUTRI.pdf

Download (773kB) | Preview

Abstract

In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough the best route. This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. This project includes the modification of main algorithm which has been implemented in the prototype development. This study discussed the emphasis on the single source shortest path at the location of specific studies. The study will produce a decision-makers prototype.

Item Type: Thesis (Masters)
Uncontrolled Keywords: Single Source, Shortest Path, Dijkstra Algorithm, Path Trajectory
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Awang Had Salleh Graduate School of Arts & Sciences
Depositing User: Mr. Badrulsaman Hamid
Date Deposited: 19 Aug 2013 07:56
Last Modified: 13 Nov 2019 02:54
URI: http://etd.uum.edu.my/id/eprint/3306

Actions (login required)

View Item View Item