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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/3601/ http://eprints.utm.my/3601/3/RohaizanRamlanMCD2005.pdf |
| _version_ | 1848890609203412992 |
|---|---|
| author | Ramlan, Rohaizan |
| author_facet | Ramlan, Rohaizan |
| author_sort | Ramlan, Rohaizan |
| building | UTeM Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-15T20:44:47Z |
| format | Thesis |
| id | utm-3601 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T20:44:47Z |
| publishDate | 2005 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-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/ http://eprints.utm.my/3601/3/RohaizanRamlanMCD2005.pdf |