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...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Belarusian National Technical University
2017-11-01
|
| Серія: | Системный анализ и прикладная информатика |
| Предмети: | |
| Онлайн доступ: | https://sapi.bntu.by/jour/article/view/178 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|