A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid

This paper presents a detailed comparison of three greedy algorithms—Prim, Kruskal, and Reverse-Delete—in optimizing the routes within Terengganu’s and Pahang’s attraction road network. The goal is to determine the most effective algorithm for constructing the minimum spanning tree (MST) that minimi...

Full description

Saved in:

Bibliographic Details
Main Author:	Mohammad Zahid, Munashahira
Format:	Thesis
Language:	English
Published:	2024
Subjects:	Difference equations Functional equations Delay differential equations Integral equations
Online Access:	https://ir.uitm.edu.my/id/eprint/106184/1/106184.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.106184
record_format	uketd_dc
spelling	my-uitm-ir.1061842024-11-30T22:55:38Z A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid 2024 Mohammad Zahid, Munashahira Difference equations. Functional equations. Delay differential equations. Integral equations This paper presents a detailed comparison of three greedy algorithms—Prim, Kruskal, and Reverse-Delete—in optimizing the routes within Terengganu’s and Pahang’s attraction road network. The goal is to determine the most effective algorithm for constructing the minimum spanning tree (MST) that minimizes total travel distance. Prim’s algorithm builds the MST by starting from an arbitrary node and continually adding the smallest edge that connects a vertex in the tree to a vertex outside the tree. Kruskal’s algorithm, on the other hand, constructs the MST by sorting all the edges and adding the smallest edge to the tree, as long as it doesn’t form a cycle. The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. This study meticulously evaluates each algorithm’s computational efficiency, implementation complexity, and performance in generating optimal routes. 2024 Thesis https://ir.uitm.edu.my/id/eprint/106184/ https://ir.uitm.edu.my/id/eprint/106184/1/106184.pdf text en public degree Universiti Teknologi MARA, Terengganu College of Computing, Informatics and Mathematics Salahudin, Nur Atikah
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Salahudin, Nur Atikah
topic	Difference equations Functional equations Delay differential equations Integral equations
spellingShingle	Difference equations Functional equations Delay differential equations Integral equations Mohammad Zahid, Munashahira A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
description	This paper presents a detailed comparison of three greedy algorithms—Prim, Kruskal, and Reverse-Delete—in optimizing the routes within Terengganu’s and Pahang’s attraction road network. The goal is to determine the most effective algorithm for constructing the minimum spanning tree (MST) that minimizes total travel distance. Prim’s algorithm builds the MST by starting from an arbitrary node and continually adding the smallest edge that connects a vertex in the tree to a vertex outside the tree. Kruskal’s algorithm, on the other hand, constructs the MST by sorting all the edges and adding the smallest edge to the tree, as long as it doesn’t form a cycle. The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. This study meticulously evaluates each algorithm’s computational efficiency, implementation complexity, and performance in generating optimal routes.
format	Thesis
qualification_level	Bachelor degree
author	Mohammad Zahid, Munashahira
author_facet	Mohammad Zahid, Munashahira
author_sort	Mohammad Zahid, Munashahira
title	A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
title_short	A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
title_full	A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
title_fullStr	A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
title_full_unstemmed	A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
title_sort	comparative analysis of prim, kruskal, and reverse-delete algorithms in optimizing routes within terengganu’s and pahang’s attraction road network / munashahira mohammad zahid
granting_institution	Universiti Teknologi MARA, Terengganu
granting_department	College of Computing, Informatics and Mathematics
publishDate	2024
url	https://ir.uitm.edu.my/id/eprint/106184/1/106184.pdf
_version_	1818588170686562304

A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid

Similar Items