Implementation level

Difference between revisions of "Dijkstra, VGL, push"

From Algowiki
Jump to navigation Jump to search
[unchecked revision][unchecked revision]
 
Line 5: Line 5:
 
= Links =
 
= Links =
  
−
[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>).
+
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  

Latest revision as of 09:36, 28 November 2022


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_push).

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,_push&oldid=10483"