FIND THE SHORTEST AND THE LONGEST TRAVELLING TOURISMS PATH IN CENTRAL JAVA USING DEPTH FIRST SEARCH ALGORITHM

Hasnani, Hanny Maeda (2010) FIND THE SHORTEST AND THE LONGEST TRAVELLING TOURISMS PATH IN CENTRAL JAVA USING DEPTH FIRST SEARCH ALGORITHM. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 04.02.0034 Hanny Maeda Hasnani COVER.pdf Download (303kB) | Preview
	Text (BAB I) 04.02.0034 Hanny Maeda Hasnani BAB I.pdf Restricted to Registered users only Download (48kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 04.02.0034 Hanny Maeda Hasnani BAB II.pdf Restricted to Repository staff only Download (261kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 04.02.0034 Hanny Maeda Hasnani BAB III.pdf Restricted to Repository staff only Download (46kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 04.02.0034 Hanny Maeda Hasnani BAB IV.pdf Restricted to Repository staff only Download (256kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 04.02.0034 Hanny Maeda Hasnani BAB V.pdf Restricted to Repository staff only Download (365kB)
	Text (BAB VI) 04.02.0034 Hanny Maeda Hasnani BAB VI.pdf Restricted to Registered users only Download (47kB)
Preview	Text (DAFTAR PUSTAKA) 04.02.0034 Hanny Maeda Hasnani DAFTAR PUSTAKA.pdf Download (81kB) | Preview

Abstract

The Application which is reported, is similar with the Travelling Salesman Problem (TSP) application. The concept ofTSP is applied in the travelling tourism case at Central Java by adding other requirements. The requirements are the limitation of distance and time. Most of TSP applications are only talk about the shortest travelling path. But, in a certain condition some tourists desire to visit a lot of places in the limited time. Therefore, this application is added with the longest path solution. So the tourist can visit more places with distance or time given. This application find the shortest and the longest path, developed using Tree as data structure and Depth first search algorithm is used to search the paths. In outline it ways of working is checking first location and other location that is become the destination, after tree data structure is built then algorithm will compare every node already being formed by tree data sructure to find the destination. And each possible that gotten by one aims to go to all place that is wended will be kept and all is featured in GUI (Graphical User Interface). This program also enhanced with time count, so gets to be known total time for each travelled distance which will be passed through.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:18
Last Modified:	27 Jan 2016 02:18
URI:	http://repository.unika.ac.id/id/eprint/7458

Actions (login required)

View Item