Difference between revisions of "BFS, C++, MPI, Boost Graph Library"
Jump to navigation
Jump to search
| [checked revision] | [checked revision] |
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{level-i}} | ||
| + | |||
Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]]. | Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]]. | ||
| − | = | + | = Links = |
| − | + | The <code>[http://www.boost.org/libs/graph_parallel/doc/html/breadth_first_search.html breadth_first_search] function</code>. | |
| − | The <code>[http://www.boost.org/libs/graph_parallel/doc/html/breadth_first_search.html | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | === | + | = Locality of data and computations = |
| + | == Locality of implementation == | ||
| + | === Structure of memory access and a qualitative estimation of locality === | ||
| + | === Quantitative estimation of locality === | ||
| − | + | = Scalability of the algorithm and its implementations = | |
| − | + | == Scalability of the algorithm == | |
| − | + | == Scalability of of the algorithm implementation == | |
| − | + | = Dynamic characteristics and efficiency of the algorithm implementation = | |
| − | + | = Run results = | |
| + | {{Buttonlinkimp|11}} | ||
[[Category:Articles in progress]] | [[Category:Articles in progress]] | ||
| − | [[Ru:C++, MPI, Boost Graph Library]] | + | [[Ru:BFS, C++, MPI, Boost Graph Library]] |
Latest revision as of 10:44, 2 July 2022
Primary author of this description: I.V.Afanasyev.
Contents
1 Links
The breadth_first_search function.
