Aid program in finding the Shortest route at simple switched data network with dijkstra algorithm

Detail Tugas Akhir

Aid program in finding the Shortest route at simple switched data network with dijkstra algorithm

Linda, Kandida (2003) Aid program in finding the Shortest route at simple switched data network with dijkstra algorithm. Skripsi thesis, Sanata Dharma University.

Berkas Tugas Akhir

PDF

Text (Abstract)
965314030.pdf

Ukuran File (18kB)

PDF

Text (Full)
965314030_Full.pdf
Restricted to Registered users only

Akses terbatas: khusus pengguna terdaftar Ukuran File (894kB)

Informasi Item

Item Type	Thesis (Skripsi)
Subjects	T Technology > TB Information Technology
Divisions	Faculty of Science and Technology > Department of Informatics Engineering
Date Deposited	09 Jan 2019 02:21
Last Modified	09 Jan 2019 02:21
URI	https://repository.usd.ac.id/id/eprint/32754

Actions (login required)

: View Item

Repositori USDPerpustakaan Universitas Sanata Dharma

Sekretariat 0274-880137 Ext: 1538 628112652539 library@usd.ac.id

Telusur

Layanan

Informasi

Kampus 2Jl. Affandi, Mrican, Caturtunggal, Kec. Depok, Kabupaten Sleman, Daerah Istimewa Yogyakarta 55281
PelayananSenin–Jumat, 07.30–21.00 WIB
Sabtu, 08.00–12.30 WIB
Libur kampus tutup.