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...
Saved in:
Main Author: | Putri, Indah Pratiwi |
---|---|
Format: | Thesis |
Language: | eng eng |
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving shortest path problem using gravitational search algorithm and neural networks
by: Sinaie, Saman
Published: (2010) -
Analysis of Dijkstra’s and A* algorithm to find the shortest path
by: Alija, Amani Saleh
Published: (2015) -
Z-path trajectory mechanism for mobile beacon-assisted localization in wireless sensor networks
by: Rezazadeh, Javad
Published: (2014) -
Fixed channel allocation schemes based on the Floyd's shortest path algorithm
by: Goh, Kelvin Tee Hiong
Published: (2001) -
Optimal path planning algorithms in virtual environments
by: Hassan, Rohayanti
Published: (2006)