DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM

Authors

  • Nikita R. Patel Assistant Professor Information Technology Department BVM Engineering College V.V.Nagar, Anand Gujarat-India
  • Bijal N. Dalwadi Assistant Professor Information Technology Department BVM Engineering College V.V.Nagar, Anand Gujarat-India

Keywords:

Principle of Optimality; Dijkstra’s; Greedy programming; Dynamic programming

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.

Downloads

Published

2016-01-25

How to Cite

Nikita R. Patel, & Bijal N. Dalwadi. (2016). DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM. International Journal of Advance Research in Engineering, Science & Technology, 3(1), 113–115. Retrieved from https://ijarest.org/index.php/ijarest/article/view/390

Issue

Vol. 3 No. 1 (2016): Volume: 03, Issue: 01 - January, 2016.

Section

Articles