Menentukan Lintasan Terpendek Mengunakan Algoritma Dijkstra dan Program Dinamik
Total View This Week0
Total View This Week0
Institusion
Universitas Sumatera Utara
Author
Siregar, Ika Rosniuni Angraini
Subject
Dijkstra Algorithm
Datestamp
2018-12-19 07:17:00
Abstract :
In this research, to determine the shortest path used some algorithm approach such as Using Dijkstra Algorithm and Dynamic Program which produce shortest path, Dijkstra algorithm approach and Dynamics Program algorithm approach give shortness and excess. The algorithm settlement is simpler and the Dynamic Program algorithm approach is more optimal.
In this research, to determine the shortest path used some algorithm approach such as Using Dijkstra Algorithm and Dynamic Program which produce shortest path, Dijkstra algorithm approach and Dynamics Program algorithm approach give shortness and excess. The algorithm settlement is simpler and the Dynamic Program algorithm approach is more optimal.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
