Chapter 11. Performance Guidelines
In this chapter, we discuss the performance impact of various choices of the BGL graph family adjacency_list. The purpose is to give BGL users some basic guidelines for which graph types might be most efficient in different situations. We present a set of experiments that shows the performance of different basic operations on several variations of the BGL adjacency_list. Sparse and dense graphs are investigated, as well as the use of two different compilers (Microsoft Visual C++ and GNU C++).
As a primary BGL graph component, adjacency_list allows users to control the actual data structures used for internal graph data structures. Its first two template parameters, EdgeList and VertexList, are used to select ...
Get The Boost Graph Library: User Guide and Reference Manual now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
