Daftar Isi: CENTRAL JAVA’S TRAVELING APPLICATION

Main Author:	Adrianto, Koko
Format:	Thesis NonPeerReviewed Book
Bahasa:	eng
Terbitan:	, 2009
Subjects:	000 Computer Science Information and General Works
Online Access:	http://repository.unika.ac.id/7499/1/05.02.0058%20Koko%20Adrianto%20COVER.pdf http://repository.unika.ac.id/7499/2/05.02.0058%20Koko%20Adrianto%20BAB%20I.pdf http://repository.unika.ac.id/7499/3/05.02.0058%20Koko%20Adrianto%20BAB%20II.pdf http://repository.unika.ac.id/7499/4/05.02.0058%20Koko%20Adrianto%20BAB%20III.pdf http://repository.unika.ac.id/7499/5/05.02.0058%20Koko%20Adrianto%20BAB%20IV.pdf http://repository.unika.ac.id/7499/6/05.02.0058%20Koko%20Adrianto%20BAB%20V.pdf http://repository.unika.ac.id/7499/7/05.02.0058%20Koko%20Adrianto%20BAB%20VI.pdf http://repository.unika.ac.id/7499/8/05.02.0058%20Koko%20Adrianto%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7499/

Daftar Isi:

Shortest path solution on central java is a software to answer the problem for choice direction. Sometimes delivered package must have an good direction to make better work. So, Shortest path solution on central java is created. Shortest path solution on central java searching all route from start place to destination city until destination city is founded. It use Tree to store city with linked list to store node from arrival city and travel schedule. It use DFS Algorithm for searching possible routes. And the result of all the route will be display in Interface.