For citations:

Karasik O.N., Prihozhy A.A. Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters. «System analysis and applied information science». 2024;(2):4-10. https://doi.org/10.21122/2309-4923-2024-2-4-10