The Boost Graph Library: User Guide and Reference Manual, ThePearson Education, 2001 M12 20 - 352 páginas The Boost Graph Library (BGL) is the first C++ library to apply the principles of generic programming to the construction of the advanced data structures and algorithms used in graph computations. Problems in such diverse areas as Internet packet routing, molecular biology, scientific computing, and telephone network design can be solved by using graph theory. This book presents an in-depth description of the BGL and provides working examples designed to illustrate the application of BGL to these real-world problems. Written by the BGL developers, The Boost Graph Library: User Guide and Reference Manual gives you all the information you need to take advantage of this powerful new library. Part I is a complete user guide that begins by introducing graph concepts, terminology, and generic graph algorithms. This guide also takes the reader on a tour through the major features of the BGL; all motivated with example problems. Part II is a comprehensive reference manual that provides complete documentation of all BGL concepts, algorithms, and classes. Readers will find coverage of:
Groundbreaking in its scope, this book offers the key to unlocking the power of the BGL for the C++ programmer looking to extend the reach of generic programming beyond the Standard Template Library. |
Dentro del libro
Resultados 1-5 de 13
... adjacency_list and adjacency_matrix , The main BGL component for representing graphs is the adjacency_list . This class generalizes the traditional adjacency - list representation for a graph . The graph is represented by a collection ...
... list . The second argument vecs specifies that std :: vector is used as the backbone of the adjacency list . This version of the adjacency_list class is similar in character to the vector of lists used in the previous section . ( Create an ...
... adjacency list object 17a / Add edges to the adjacency list 17b ) 16 ) ( Perform the topological sort and output the results 16 return EXIT_SUCCESS ; 1.4.2 The Depth - First Search Generic Algorithm The BGL implementation of ...
Alcanzaste el límite de visualización de este libro.
Alcanzaste el límite de visualización de este libro.
Contenido
A BGL Tutorial | |
Basic Graph Algorithms | |
ShortestPaths Problems | |
MinimumSpanningTree Problem | |
Connected Components | |
A Knights Tour | |
Interfacing with Other Graph Libraries | |
Performance Guidelines | |
BGL Concepts | |
Otras ediciones - Ver todas
The Boost Graph Library: User Guide and Reference Manual Jeremy Siek,Lie-Quan Lee,Andrew Lumsdaine Vista de fragmentos - 2002 |