MENENTUKAN LINTASAN TERPENDEK PADA PETA SUMATERA BARAT MENGGUNAKAN ALGORITMA DIJKSTRA

AGUSMAN YA'ARO, HAREFA (2011) MENENTUKAN LINTASAN TERPENDEK PADA PETA SUMATERA BARAT MENGGUNAKAN ALGORITMA DIJKSTRA. D3 thesis, Universitas Andalas.

[img]
Preview
 Text (skripsi fulltext)
2011_07134070_03skrip1011.pdf - Published Version
Download (13MB) | Preview
Item Type: Thesis (D3)
Supervisors: Budi Rudianto,M.si
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam > S1 Matematika
Depositing User: Mahasiswa pkl 2021
Date Deposited: 22 Jul 2021 07:01
Last Modified: 22 Jul 2021 07:01
URI: http://scholar.unand.ac.id/id/eprint/78020

Actions (login required)

View Item View Item
eSkripsi Universitas Andalas is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.