Search Minimum Budget By Bus

Chirstiawan, Erick (2009) Search Minimum Budget By Bus. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0072 Erick Chirstiawan COVER.pdf Download (184kB) | Preview
	Text (BAB I) 05.02.0072 Erick Chirstiawan BAB I.pdf Restricted to Registered users only Download (43kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0072 Erick Chirstiawan BAB II.pdf Restricted to Repository staff only Download (76kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0072 Erick Chirstiawan BAB III.pdf Restricted to Repository staff only Download (42kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0072 Erick Chirstiawan BAB IV.pdf Restricted to Repository staff only Download (75kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0072 Erick Chirstiawan BAB V.pdf Restricted to Repository staff only Download (150kB)
	Text (BAB VI) 05.02.0072 Erick Chirstiawan BAB VI.pdf Restricted to Registered users only Download (40kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0072 Erick Chirstiawan DAFTAR PUSTAKA.pdf Download (30kB) | Preview

Abstract

The application Travelling Sales Problem has been made, one of them is to use java. On this project using Java application, the purpose of this application is made in order to facilitate the user in finding the lowest price possible and the purpose of using the city bus. The application program this project was undertaken with the provisions, that is looking for the minimal value and the city of the cost the most that was taken, if the city tariff that has been determined bigger than the cost that input then this program will stop in the city that beforehand. In making this application is used because the data structure using the matrix become easier to find value in the price of using the graph data structure Algorithm used in creating this application using the DFS algorithm, the DFS apply principles of Last in First Out, DFS has more than that in the ease of reading from left to right. So the conclusion that was taken by us could use many structure data and the algorithm, to application this in fact not all that effisien if using the DFS algorithm, the algorithm that be suitable applications this was the algorithm as knapsack and the data structure as graph.

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:14
Last Modified:	27 Jan 2016 02:14
URI:	http://repository.unika.ac.id/id/eprint/7514

Actions (login required)

View Item