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.
PDF (Full text)
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.
|Item Type:||Thesis (Masters)|
|Additional Information:||Thesis (Sarjana Sains (Teknologi Maklumat - Pembuatan)) - Universiti Teknologi Malaysia, 2005; Supervisor : Assoc. Prof. Dr. Ab Rahman Ahmad|
|Uncontrolled Keywords:||road networking; shortest path; Djikstra, Floyd-Warshall, Bellman-Ford|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Computer Science and Information System|
|Deposited By:||Ms Zalinda Shuratman|
|Deposited On:||13 Jun 2007 09:07|
|Last Modified:||19 Jan 2011 05:58|
Repository Staff Only: item control page