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...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Belarusian National Technical University
2017-11-01
|
| 叢編: | Системный анализ и прикладная информатика |
| 主題: | |
| 在線閱讀: | https://sapi.bntu.by/jour/article/view/178 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!