Difference between revisions of "Δ-stepping algorithm"
Jump to navigation
Jump to search
| [quality revision] | [quality revision] |
(Created page with "{{level-a}} {{Russian}} Category:Started articles ru:Алгоритм Δ-шагания") |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{level-a}} | {{level-a}} | ||
| − | |||
{{Russian}} | {{Russian}} | ||
| Line 6: | Line 5: | ||
[[ru:Алгоритм Δ-шагания]] | [[ru:Алгоритм Δ-шагания]] | ||
| + | |||
| + | === Existing implementations of the algorithm === | ||
| + | |||
| + | * C++, MPI: [http://www.boost.org/libs/graph_parallel/doc/html/index.html Parallel Boost Graph Library] (функция <code>[http://www.boost.org/libs/graph_parallel/doc/html/dijkstra_shortest_paths.html#delta-stepping-algorithm delta_stepping_shortest_paths]</code>).{{Buttonlink|http://top53.parallel.ru/algo_results/implementation/25}} | ||
| + | * Gap: {{Buttonlink|http://top53.parallel.ru/algo_results/implementation/38}} | ||
Revision as of 17:38, 15 June 2018
This page is currently available in Russian only. Push "Русский" on the left colomn to view the page.
Existing implementations of the algorithm
- C++, MPI: Parallel Boost Graph Library (функция
delta_stepping_shortest_paths). - Gap:
