@thesis{thesis,
		author={Siregar  Ika Rosniuni Angraini},
		title ={Menentukan Lintasan Terpendek Mengunakan Algoritma Dijkstra dan Program Dinamik},
		year={2018},
		url={},
		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.}
		}