Hartono, Stephen (2009) Searching The Minimum Route For Cities In Java Using Depth First Search Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.
|
Text (COVER)
04.02.0045 Stephen Hartono COVER.pdf Download (502kB) | Preview |
|
Text (BAB I)
04.02.0045 Stephen Hartono BAB I.pdf Restricted to Registered users only Download (98kB) |
||
Text (BAB II available document only in library of Soegijapranata Catholic University)
04.02.0045 Stephen Hartono BAB II.pdf Restricted to Repository staff only Download (178kB) |
||
Text (BAB III available document only in library of Soegijapranata Catholic University)
04.02.0045 Stephen Hartono BAB III.pdf Restricted to Repository staff only Download (123kB) |
||
Text (BAB IV available document only in library of Soegijapranata Catholic University)
04.02.0045 Stephen Hartono BAB IV.pdf Restricted to Repository staff only Download (146kB) |
||
Text (BAB V available document only in library of Soegijapranata Catholic University)
04.02.0045 Stephen Hartono BAB V.pdf Restricted to Repository staff only Download (299kB) |
||
Text (BAB VI)
04.02.0045 Stephen Hartono BAB VI.pdf Restricted to Registered users only Download (96kB) |
||
|
Text (DAFTAR PUSTAKA)
04.02.0045 Stephen Hartono DAFTAR PUSTAKA.pdf Download (112kB) | Preview |
Abstract
This applications use for searching minimum route from this start city to destinations city and computer will be search with use DFS Algorithm for searching minimum route in the data structure which containing data city and distance city to city and data structure use tree and this result show the route which must pass.
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:17 |
Last Modified: | 27 Jan 2016 02:17 |
URI: | http://repository.unika.ac.id/id/eprint/7468 |
Actions (login required)
View Item |