Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison
In this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken Dijkstra's algorithm with dynamically va...
| Glavni autori: | , |
|---|---|
| Format: | Članak |
| Jezik: | English |
| Izdano: |
Belarusian National Technical University
2024-12-01
|
| Serija: | Системный анализ и прикладная информатика |
| Teme: | |
| Online pristup: | https://sapi.bntu.by/jour/article/view/700 |