Algoritma Dijkstra Untuk Pemantauan Lalu Lintas dan Pelacakan Jalur Alternatif Optimal  

Oleh:

Purba, Lasman Parulian

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: Gematek: Jurnal Teknik Komputer vol. 7 no. 1 (Mar. 2005), page 40-48.
Topik: ALGORITHM; dijkstra algorithm; shortest path; computer program; microcontroller

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: GG6.2 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Information about traffic condition can be obtained from radio forecasting which is not accurate and fast. Therefore, an accurate and fast method of monitoring traffic conditions is needed. In this research Dijkstra Algorithm is used to get shortest path with computer program called Shortest Path Compass (SPC). SPC can be run in computer with pentium processor 133 with 32 MB RAM. It is a computer program integrated with Integrated Circuit ATMEL 89 x 5y. Tested in the Control lab and microprocessor lab, SCP runs well and gives exact decision about the shortest path according to Dijkstra Algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali