HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are known. A new heterogeneous block algorithm is...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Belarusian National Technical University
2017-11-01
|
| Serie: | Системный анализ и прикладная информатика |
| Ämnen: | |
| Länkar: | https://sapi.bntu.by/jour/article/view/178 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|