Implementation level

Disjoint set union, Boost Graph Library

From Algowiki
Revision as of 14:16, 6 July 2022 by ASA (talk | contribs) (Created page with "{{level-i}} Primary author of this description: I.V.Afanasyev. = Links = [http://www.boost.org/libs/graph/doc/ Boost Graph Library] (functio...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


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

1 Links

Boost Graph Library (function incremental_components).

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=Disjoint_set_union,_Boost_Graph_Library&oldid=10307"