Search Minimum Budget By Bus
| ctrlnum |
7514 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://repository.unika.ac.id/7514/</relation><title>Search Minimum Budget By Bus</title><creator>Chirstiawan, Erick</creator><subject>Data processing & computer science</subject><description>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.</description><date>2009</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/1/05.02.0072%20Erick%20Chirstiawan%20COVER.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/2/05.02.0072%20Erick%20Chirstiawan%20BAB%20I.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/3/05.02.0072%20Erick%20Chirstiawan%20BAB%20II.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/4/05.02.0072%20Erick%20Chirstiawan%20BAB%20III.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/5/05.02.0072%20Erick%20Chirstiawan%20BAB%20IV.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/6/05.02.0072%20Erick%20Chirstiawan%20BAB%20V.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/7/05.02.0072%20Erick%20Chirstiawan%20BAB%20VI.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7514/8/05.02.0072%20Erick%20Chirstiawan%20DAFTAR%20PUSTAKA.pdf</identifier><identifier> Chirstiawan, Erick (2009) Search Minimum Budget By Bus. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata. </identifier><recordID>7514</recordID></dc>
|
| language |
eng |
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
| author |
Chirstiawan, Erick |
| title |
Search Minimum Budget By Bus |
| publishDate |
2009 |
| topic |
Data processing & computer science |
| url |
http://repository.unika.ac.id/7514/1/05.02.0072%20Erick%20Chirstiawan%20COVER.pdf http://repository.unika.ac.id/7514/2/05.02.0072%20Erick%20Chirstiawan%20BAB%20I.pdf http://repository.unika.ac.id/7514/3/05.02.0072%20Erick%20Chirstiawan%20BAB%20II.pdf http://repository.unika.ac.id/7514/4/05.02.0072%20Erick%20Chirstiawan%20BAB%20III.pdf http://repository.unika.ac.id/7514/5/05.02.0072%20Erick%20Chirstiawan%20BAB%20IV.pdf http://repository.unika.ac.id/7514/6/05.02.0072%20Erick%20Chirstiawan%20BAB%20V.pdf http://repository.unika.ac.id/7514/7/05.02.0072%20Erick%20Chirstiawan%20BAB%20VI.pdf http://repository.unika.ac.id/7514/8/05.02.0072%20Erick%20Chirstiawan%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7514/ |
| contents |
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. |
| id |
IOS2679.7514 |
| institution |
Universitas Katolik Soegijapranata |
| institution_id |
334 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Katolik Soegijapranata |
| library_id |
522 |
| collection |
Unika Repository |
| repository_id |
2679 |
| subject_area |
Akuntansi Arsitektur Ekonomi |
| city |
SEMARANG |
| province |
JAWA TENGAH |
| repoId |
IOS2679 |
| first_indexed |
2017-02-25T15:02:35Z |
| last_indexed |
2017-02-25T15:02:35Z |
| recordtype |
dc |
| _version_ |
1765771673326321664 |
| score |
17.538404 |