e-ISSN 2393-9877•p-ISSN 2394-2444•Quarterly•Open Access•IF 5.99
Track PaperUpload ReceiptContact
IJAREST logoIJARESTInt. Journal of Advance Research in Engineering, Science & Technology

DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM

Nikita R. Patel, Bijal N. Dalwadi

Assistant Professor Information Technology Department BVM Engineering College V.V.Nagar, Anand Gujarat-India, India

IJAR-2016-DF1EE2Vol. 3, Issue 1January 2016Pages 113-115

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

How to cite

APA
Nikita R. Patel, Bijal N. Dalwadi (2016). DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM. IJAREST, 3(1), 113-115.
BibTeX
@article{ijarest2016DF1EE2,
  title={{DIJKSTRA GREEDY -DYNAMICPROGRAMMINGALGORITHM}},
  author={Nikita R. Patel and Bijal N. Dalwadi},
  journal={IJAREST},
  volume={3},
  number={1},
  pages={113-115},
  year={2016}
}

Published under an open-access licence. See copyright & licensing.

✆