Evaluating the Influence of Graph Density on the Efficiency of Shortest Path Algorithms Using Different Data Structures
This paper presents a comparative analysis of two variants of a classical algorithm for finding the shortest path in a connected graph. The first variant uses an adjacency matrix (AM) to verify the existence of an edge (arc) between two vertices, while the second variant performs the same verification using an adjacenc...