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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/3601/3/RohaizanRamlanMCD2005.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my-utm-ep.3601 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-utm-ep.36012020-03-09T07:08:00Z Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka 2005-10 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 http://eprints.utm.my/id/eprint/3601/ http://eprints.utm.my/id/eprint/3601/3/RohaizanRamlanMCD2005.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information System Faculty Computer Science and Information System |
| institution |
Universiti Teknologi Malaysia |
| collection |
UTM Institutional Repository |
| language |
English |
| topic |
QA75 Electronic computers Computer science |
| spellingShingle |
QA75 Electronic computers Computer science Ramlan, Rohaizan Penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : Negeri Johor dan Melaka |
| 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 |
| qualification_level |
Master's degree |
| author |
Ramlan, Rohaizan |
| author_facet |
Ramlan, Rohaizan |
| author_sort |
Ramlan, Rohaizan |
| title |
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_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_sort |
penilaian kaedah laluan terpendek : rangkaian jalan raya kajian kes : negeri johor dan melaka |
| granting_institution |
Universiti Teknologi Malaysia, Faculty of Computer Science and Information System |
| granting_department |
Faculty Computer Science and Information System |
| publishDate |
2005 |
| url |
http://eprints.utm.my/id/eprint/3601/3/RohaizanRamlanMCD2005.pdf |
| _version_ |
1747814459751006208 |