Simulasi Lintasan Terpendek pada Graf Komplit Menggunakan Ant Colony Optimization Algorithm

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

[img]
Preview
Text
Fulltext.pdf - Published Version

Download (1MB) | Preview
[img]
Preview
Text
Similaritas.pdf - Published Version

Download (3MB) | Preview
[img]
Preview
Text
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
Contributors:
ContributionNameNIDN/NIDK
EditorRangkuti, Yulita Molliqnidn0022017604
EditorArnita, nidn0021067609
Keywords: Algoritma; Graph komplit; Lintasan terpendek; Pemrograman
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 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
URI: http://digilib.unimed.ac.id/id/eprint/40576

Actions (login required)

View Item View Item