Free Trial

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint
Share this Page URL
Help

Part I: User Guide > Performance Guidelines

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 actual containers to represent the sequence of out-edges and the sequence of vertices, respectively. Users can use vecS, listS, or setS for EdgeList to choose either std::vector, std::list, or std::set. Users can specify vecS or listS to choose std::vector or std::list, respectively, for the backbone.


  

You are currently reading a PREVIEW of this book.

                                                                                                                    

Get instant access to over $1 million worth of books and videos.

  

Start a Free Trial


  
  • Safari Books Online
  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint