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...
Sábháilte in:
| Príomhchruthaitheoirí: | , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Belarusian National Technical University
2017-11-01
|
| Sraith: | Системный анализ и прикладная информатика |
| Ábhair: | |
| Rochtain ar líne: | https://sapi.bntu.by/jour/article/view/178 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|