Skip to main navigation Skip to search Skip to main content

On the optimization of Dijkstra's algorithm

  • American University of the Middle East

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

In this paper, we propose some amendment on Dijkstra's algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra's algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra's algorithm is less than the number of the graph's nodes.

Original languageEnglish
Title of host publicationInformatics in Control, Automation and Robotics
Pages393-397
Number of pages5
EditionVOL. 2
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 3rd International Asia Conference on Informatics in Control, Automation and Robotics, CAR 2011 - Shenzhen, China
Duration: 24 Dec 201125 Dec 2011

Publication series

NameLecture Notes in Electrical Engineering
NumberVOL. 2
Volume133 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2011 3rd International Asia Conference on Informatics in Control, Automation and Robotics, CAR 2011
Country/TerritoryChina
CityShenzhen
Period24/12/1125/12/11

Keywords

  • Dijkstra's algorithm
  • directed graph
  • shortest path

Fingerprint

Dive into the research topics of 'On the optimization of Dijkstra's algorithm'. Together they form a unique fingerprint.

Cite this