Execution Performance of Dijkstra’s Algorithm: A Cross-Language Analysis

Abstract

This present study looks at the intensive performance analysis of the algorithm of DIJKSTRA executive in four programming languages:  Python, Java, C++, and MATLAB. This study explains how the performance of the DIJKSTRA algorithm changes across these four languages, which is often used to find the shortest distance. It considers key performance factors and different types of graphs. The researchers analyzed various graph complications to mimic real-world problems, including small, large, rare, and dense examples. They tested how well the algorithm worked in terms of time to run, memory usage, complexity, and efficiency in situations using the selected language. The results show how the output changes with the choice of programming languages, and have a big effect on the performance of the algorithms, with each language having its own strengths and weaknesses. Python takes less memory but a long time to run, while C++ is faster but uses more memory for execution in dense graphs. MATLAB is strong in computation but uses a lot of memory, and Java offers a good balance between time and memory. These results show the importance of choosing the right languages depending on the specific task we need. This study adds to the discussion about adopting algorithms. It helps programmers make informed choices about which language to use for implementing the Dijkstra algorithm based on their needs and challenges.