Difference between revisions of "BFS, C++, Boost Graph Library"
Jump to navigation
Jump to search
| [checked revision] | [checked revision] |
(Created page with "Primary author of this description: I.V.Afanasyev. == Software implementation of the algorithm: C++, Boost Graph Library == The <code>[http:/...") |
|||
| Line 3: | Line 3: | ||
== Software implementation of the algorithm: C++, Boost Graph Library == | == Software implementation of the algorithm: C++, Boost Graph Library == | ||
| − | The <code>[http://www.boost.org/libs/graph/doc/breadth_first_search.html | + | The <code>[http://www.boost.org/libs/graph/doc/breadth_first_search.html breadth_first_search]</code>, <code>[http://www.boost.org/libs/graph/doc/breadth_first_visit.html breadth_first_visit] functions</code>). |
=== Implementation peculiarities of the serial algorithm === | === Implementation peculiarities of the serial algorithm === | ||
Revision as of 12:37, 28 June 2022
Primary author of this description: I.V.Afanasyev.
Contents
- 1 Software implementation of the algorithm: C++, Boost Graph Library
- 1.1 Implementation peculiarities of the serial algorithm
- 1.2 Locality of data and computations
- 1.3 Possible methods and considerations for parallel implementation of the algorithm
- 1.4 Scalability of the algorithm and its implementations
- 1.5 Dynamic characteristics and efficiency of the algorithm implementation
- 1.6 Conclusions for different classes of computer architecture
1 Software implementation of the algorithm: C++, Boost Graph Library
The breadth_first_search, breadth_first_visit functions).
