Implementation level

Dijkstra, C++, Boost Graph Library

From Algowiki
Jump to navigation Jump to search


Primary author of this description: I.V.Afanasyev.

1 Links

Boost Graph Library (functions dijkstra_shortest_paths, dijkstra_shortest_paths_no_color_map), complexity [math]O(m + n \ln n)[/math].

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,_C%2B%2B,_Boost_Graph_Library&oldid=10249"