Implementation level

Dijkstra, VGL, pull

From Algowiki
Revision as of 09:40, 28 November 2022 by ASA (talk | contribs) (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 <c...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Primary author of this description: .

1 Links

https://github.com/afanasyev-ilya/VectorGraphLibrary/blob/master/algorithms/sssp/shortest_paths.hpp (function vgl_dijkstra_all_active_pull).

VGL library description: https://vgl.parallel.ru/documentation.html

2 Locality of data and computations

2.1 Locality of implementation

2.1.1 Structure of memory access and a qualitative estimation of locality

2.1.2 Quantitative estimation of locality

3 Scalability of the algorithm and its implementations

3.1 Scalability of the algorithm

3.2 Scalability of of the algorithm implementation

4 Dynamic characteristics and efficiency of the algorithm implementation

5 Run results

Retrieved from "https://algowiki-project.org/algowiki/en/index.php?title=Dijkstra,_VGL,_pull&oldid=10484"