1.
Hutasoit ETH. Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan). json [Internet]. 2019 Aug. 21 [cited 2025 Oct. 28];1(1):20-5. Available from: https://ejurnal.stmik-budidarma.ac.id/index.php/JSON/article/view/1367