Fastest Time and Minimum Cost Traveling in East Java Using DFS Algorithm

Saputra, Indra (2009) Fastest Time and Minimum Cost Traveling in East Java Using DFS Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0019 Indra Saputra COVER.pdf Download (461kB) | Preview
	Text (BAB I) 05.02.0019 Indra Saputra BAB I.pdf Restricted to Registered users only Download (197kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0019 Indra Saputra BAB II.pdf Restricted to Repository staff only Download (212kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0019 Indra Saputra BAB III.pdf Restricted to Repository staff only Download (220kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0019 Indra Saputra BAB IV.pdf Restricted to Repository staff only Download (388kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0019 Indra Saputra BAB V.pdf Restricted to Repository staff only Download (1MB)
	Text (BAB VI) 05.02.0019 Indra Saputra BAB VI.pdf Restricted to Registered users only Download (195kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0019 Indra Saputra DAFTAR PUSTAKA.pdf Download (322kB) | Preview

Abstract

A software package designed to help solve common problems faced by salesman in particular. They need a quick route and cheap. So this device is designed to find the routes where it could pass for a fee. So they can decide which route they want. This software will searching all route from source city to destination city until the fasted arrival route to destination city is founded. It used DFS Algorithm for searching possible routes combination and Tree as data structure. And the result of all the route will be display in text area (result searching area), using GUI (Graphical User Interface) programming. If you want to go from one city to another this program can count every possibility route, travel time and travel cost between those city.

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

Actions (login required)

View Item