On The Optimization of Dijkstras Algorithm

TL;DR

This paper introduces modifications to Dijkstra's algorithm to reduce its iterations by handling multiple nodes satisfying the selection criteria simultaneously, thereby optimizing its performance.

Contribution

The paper proposes a novel amendment to Dijkstra's algorithm that decreases the maximum number of iterations by addressing multiple candidate nodes at each step.

Findings

Maximum iterations are less than the number of nodes after modification

The proposed method improves efficiency of Dijkstra's algorithm

The approach handles multiple nodes satisfying the selection condition

Abstract

In this paper, we propose some amendment on Dijkstras 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 Dijkstras algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstras algorithm is less than the number of the graphs nodes.