Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters
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 bloc...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Belarusian National Technical University
2024-09-01
|
| Sarja: | Системный анализ и прикладная информатика |
| Aiheet: | |
| Linkit: | https://sapi.bntu.by/jour/article/view/669 |