Implementasi Algoritma Dynamic Programming untuk Menentukan Route terpendek Pada Graph Multi Tahap (Multistage Graph)

Abstract

This article studied about shortest path with the Dynamic Programming algorithm to search route shortest from the source s to the aim t in graph multi the stage (Multistage Graph) where Dynamic Programming was the solution method to the problem by means of untangling the solution to a collection steps or the stage so until the solution could be from the problem gazed at of a series of decision that mutually. that afterwards implementation in a program with used Visual Basic 6,0.