DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM
Nikita R. Patel
, Bijal N. Dalwadi
Assistant Professor Information Technology Department BVM Engineering College V.V.Nagar, Anand Gujarat-India, India
Assistant Professor Information Technology Department BVM Engineering College V.V.Nagar, Anand Gujarat-India, India
Vol. 3, Issue 1 pp. 113-115 🌐 Open Access
ABSTRACT
Dijkstra’s Algorithm is one of the popular algorithm for finding shortest path in computer science. As well it is also popular in operations research. It is generally presented and viewed as a greedy algorithm. In this Article we attempt to change this perception by providing a dynamic programming perspective on the algorithm. This Article present Dijkstra’s is a greedy as well dynamic programming algorithm.
Keywords:
Principle of Optimality; Dijkstra’s; Greedy programming; Dynamic programming
