Browsing № 2 by Author "Karasik, O. N."
Now showing items 1-1 of 1
-
Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters
Karasik, O. N.; Prihozhy, A. A. (БНТУ, 2024)The problem of finding all shortest paths between vertices in a graph (APSP) has real-life applications in planning, communication, economics and many other areas. APSP problem can be solved using various algorithms, starting from Floyd-Warshall’s algorithm and ending with advanced, much faster blocked algorithms like Heterogeneous Blocked All-Pairs Shortest Path Algorithm designed ...2024-08-30