Difference between revisions of "Dijkstra, VGL, push"
Jump to navigation
Jump to search
| [unchecked revision] | [unchecked revision] |
(Created page with "{{level-i}} Primary author of this description: . = Links = [https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp] (function...") |
|||
| Line 5: | Line 5: | ||
= Links = | = Links = | ||
| − | [https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp] (function <code>vgl_dijkstra_all_active_push</code>). | + | [https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp]https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp (function <code>vgl_dijkstra_all_active_push</code>). |
VGL library description: https://vgl.parallel.ru/documentation.html | VGL library description: https://vgl.parallel.ru/documentation.html | ||
Revision as of 09:35, 28 November 2022
Primary author of this description: .
Contents
1 Links
[1]https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp (function vgl_dijkstra_all_active_push).
VGL library description: https://vgl.parallel.ru/documentation.html
