Compare Greedy and Dijkstra Algorithm to Find the Shortest Path of Tourist Sites at Semarang

Gunawan, Frengky (2009) Compare Greedy and Dijkstra Algorithm to Find the Shortest Path of Tourist Sites at Semarang. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0022 Frengky Gunawan COVER.pdf Download (468kB) | Preview
	Text (BAB I) 05.02.0022 Frengky Gunawan BAB I.pdf Restricted to Registered users only Download (102kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0022 Frengky Gunawan BAB II.pdf Restricted to Repository staff only Download (111kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0022 Frengky Gunawan BAB III.pdf Restricted to Repository staff only Download (100kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0022 Frengky Gunawan BAB IV.pdf Restricted to Repository staff only Download (144kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0022 Frengky Gunawan BAB V.pdf Restricted to Repository staff only Download (292kB)
	Text (BAB VI) 05.02.0022 Frengky Gunawan BAB VI.pdf Restricted to Registered users only Download (122kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0022 Frengky Gunawan DAFTAR PUSTAKA.pdf Download (116kB) | Preview

Abstract

The purpose of this application is to find shortest path from one tourist site to another tourist sites at Semarang uses Java programming. To find shortest path, this application compares possibility distances. The most minimum distance at the moment will be stored and used to calculate the shortest path. The search methods can use Greedy algorithm and Dijktra algorithm to find the best solutions, uses Tree for Data Structure and GUI (Graphical User Interface). Greedy and Dijkstra algorithm have almost same method for search. Greedy algorithm only choose one distance with the most minimum distance until found destination. Dijkstra algorithm also choose one distance with the most minimum distance until found destination but the searching process is not over yet. Dijkstra algorithm calculating all possibility path from starting location to destination then choose the best solution by compared which ways had the most minimum distance. With that two algorithms, this application can guarantee the solutions would be more accurate. User just pick one solution that he desired. This application can also insert and update the original data of information which stored in file text.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:15
Last Modified:	27 Jan 2016 02:15
URI:	http://repository.unika.ac.id/id/eprint/7490

Actions (login required)

View Item