Shortest Path Trajectory System Based on Dijkstra Algorithm

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...

Full description

Bibliographic Details
Main Author: Putri, Indah Pratiwi
Format: Thesis
Language:English
English
Published: 2012
Subjects:
Online Access:https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/
http://sierra.uum.edu.my/record=b1241357~S1
Abstract Abstract here
_version_ 1855353269609562112
author Putri, Indah Pratiwi
author_facet Putri, Indah Pratiwi
author_sort Putri, Indah Pratiwi
description 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.
format Thesis
id oai:etd.uum.edu.my:3306
institution Universiti Utara Malaysia
language English
English
publishDate 2012
record_format EPrints
record_pdf Abstract
spelling oai:etd.uum.edu.my:33062019-11-13T02:54:06Z https://etd.uum.edu.my/3306/ Shortest Path Trajectory System Based on Dijkstra Algorithm Putri, Indah Pratiwi QA75 Electronic computers. Computer science 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. 2012 Thesis NonPeerReviewed text en https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf text en https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf Putri, Indah Pratiwi (2012) Shortest Path Trajectory System Based on Dijkstra Algorithm. Masters thesis, Universiti Utara Malaysia. http://sierra.uum.edu.my/record=b1241357~S1
spellingShingle QA75 Electronic computers. Computer science
Putri, Indah Pratiwi
Shortest Path Trajectory System Based on Dijkstra Algorithm
thesis_level Master
title Shortest Path Trajectory System Based on Dijkstra Algorithm
title_full Shortest Path Trajectory System Based on Dijkstra Algorithm
title_fullStr Shortest Path Trajectory System Based on Dijkstra Algorithm
title_full_unstemmed Shortest Path Trajectory System Based on Dijkstra Algorithm
title_short Shortest Path Trajectory System Based on Dijkstra Algorithm
title_sort shortest path trajectory system based on dijkstra algorithm
topic QA75 Electronic computers. Computer science
url https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/
http://sierra.uum.edu.my/record=b1241357~S1
work_keys_str_mv AT putriindahpratiwi shortestpathtrajectorysystembasedondijkstraalgorithm