About Testing the Speed of Calculating the Shortest Route

TL;DR

This paper introduces a testing method to evaluate potential speed improvements for the Bellman-Kalaba algorithm in calculating shortest routes in large graphs, focusing on time efficiency analysis.

Contribution

It proposes a novel testing approach to assess whether accelerating the Bellman-Kalaba algorithm is feasible for large-scale graph problems.

Findings

Testing method effectively evaluates acceleration potential.

Identifies scenarios where Bellman-Kalaba can be optimized.

Provides insights into computational time reductions.

Abstract

Applied into a various area of domains, the graph theory and its applications allow the determination of the shortest route. The common algorithm to solve this problem is Bellman-Kalaba, based on the matrix multiplying operation. If the graph is very large (e.g., the dimension of the associated incidence matrix is big) one of the main problems is to reduce the calculus time. This paper presents a testing method able to analyze if an acceleration of the Bellman-Kalaba is possible and able to determine the time efficiency.