Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka

Modern technology that is used to find the shortest path had clear up problems like finding the shortest path between the two location. Random networking, which didn’t have th e exact road network, is used in most of the shortest path’s research. There are vari ous classical methods that are use...

Full description

Saved in:
Bibliographic Details
Main Author: Ramlan, Rohaizan
Format: Thesis
Language:en
Published: 2005
Subjects:
Online Access:http://eprints.utm.my/3601/3/RohaizanRamlanMCD2005.pdf
http://eprints.utm.my/3601/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1845470932297056256
author Ramlan, Rohaizan
author_facet Ramlan, Rohaizan
author_sort Ramlan, Rohaizan
building UTM Library
collection Institutional Repository
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
continent Asia
country Malaysia
description Modern technology that is used to find the shortest path had clear up problems like finding the shortest path between the two location. Random networking, which didn’t have th e exact road network, is used in most of the shortest path’s research. There are vari ous classical methods that are used to find the shortest path. Some of it are Djikstra, Floyd-Warshall and Bellman-Ford. But every method has it’s restriction and advantage to im plement for the exact road networking. Assessment will be done by calculate the algorithm complexion and runtime using the computer. From the assessment, a proper method is found in order to find Johore’s and Malacca’s shortest path road networking.
format Thesis
id my.utm.eprints-3601
institution Universiti Teknologi Malaysia
language en
publishDate 2005
record_format eprints
spelling my.utm.eprints-36012020-03-09T07:08:00Z http://eprints.utm.my/3601/ Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka Ramlan, Rohaizan QA75 Electronic computers. Computer science Modern technology that is used to find the shortest path had clear up problems like finding the shortest path between the two location. Random networking, which didn’t have th e exact road network, is used in most of the shortest path’s research. There are vari ous classical methods that are used to find the shortest path. Some of it are Djikstra, Floyd-Warshall and Bellman-Ford. But every method has it’s restriction and advantage to im plement for the exact road networking. Assessment will be done by calculate the algorithm complexion and runtime using the computer. From the assessment, a proper method is found in order to find Johore’s and Malacca’s shortest path road networking. 2005-10 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/3601/3/RohaizanRamlanMCD2005.pdf Ramlan, Rohaizan (2005) Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information System.
spellingShingle QA75 Electronic computers. Computer science
Ramlan, Rohaizan
Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title_full Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title_fullStr Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title_full_unstemmed Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title_short Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka
title_sort penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : negeri johor dan melaka
topic QA75 Electronic computers. Computer science
url http://eprints.utm.my/3601/3/RohaizanRamlanMCD2005.pdf
http://eprints.utm.my/3601/
url_provider http://eprints.utm.my/