Difference between revisions of "Δ-stepping algorithm"
Jump to navigation
Jump to search
| [quality revision] | [quality revision] |
| Line 8: | Line 8: | ||
=== Existing implementations of the algorithm === | === 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>).{{ | + | * 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>).{{Buttonlinkimp|25}} |
| − | * Gap: {{ | + | * Gap: {{Buttonlinkimp|38}} |
Revision as of 14:42, 19 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:
