Implementation level

Difference between revisions of "Purdom's, Boost Graph Library"

From Algowiki
Jump to navigation Jump to search
[unchecked revision][unchecked revision]
(Created page with "{{level-i}} Primary author of this description: I.V.Afanasyev. = Links = [http://www.boost.org/libs/graph/doc/Boost Graph Library] (function...")
 
Line 5: Line 5:
 
= Links =
 
= Links =
  
[http://www.boost.org/libs/graph/doc/Boost Graph Library] (function <code>[http://www.boost.org/libs/graph/doc/transitive_closure.html transitive_closure]</code>).
+
[http://www.boost.org/libs/graph/doc/Boost_Graph_Library] (function <code>[http://www.boost.org/libs/graph/doc/transitive_closure.html transitive_closure]</code>).
  
  

Revision as of 12:01, 5 July 2022


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

1 Links

[1] (function transitive_closure).


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