Syahputra, Hermawan (2018) Simulasi Lintasan Terpendek pada Graf Komplit Menggunakan Ant Colony Optimization Algorithm. Jurnal Sains Indonesia, 42 (2). pp. 44-51. ISSN 0853-3792
Preview
Fulltext.pdf - Published Version
Download (1MB) | Preview
Preview
Similaritas.pdf - Published Version
Download (3MB) | Preview
Preview
Reviewer.pdf - Published Version
Download (848kB) | Preview
Official URL: https://doi.org/10.24114/jsi.v42i2.12248
Abstract
This study aims to build a shortest path simulation program on the complete
graph
| Item Type: | Article |
|---|---|
| Keywords: | Algoritma; Graph komplit; Lintasan terpendek; Pemrograman |
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75.5 Electronic computers. Computer science |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika |
| Depositing User: | Mrs Elsya Fitri Utami |
| Date Deposited: | 02 Oct 2020 09:15 |
| Last Modified: | 02 Oct 2020 09:15 |
| URI: | https://digilib.unimed.ac.id/id/eprint/40576 |
Actions (login required)
- View Item