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 71
... Graph 10.3 Implementing Graph Adaptors 11. Performance Guidelines 11.1 Graph Class Comparisons 11.1.1 The Results and Discussion 11.2 Conclusion II. Reference Manual 12. BGL Concepts Notation 12.1 Graph Traversal Concepts 12.1.1 Undirected ...
... graph can be directed or undirected, meaning the edge set in the graph consists respectively of directed or undirected edges. An edge of a directed graph is an ordered pair (u, v) with u as the source vertex and v as the target vertex ...
... graph is directed or undirected). 4. An in-edge iterator is used to access the in-edges of a vertex v. Its value type is an edge descriptor. Each edge descriptor in this iterator range has v as the target vertex and a vertex that v is ...
... Graph Classes The BGL contains two primary graph classes. 1.3 Graph Classes and Adaptors The graph types provided by the BGL fall into two categories . The first is the graph classes that are used to store a graph in memory . The second is ...
... graph . • Directed specifies whether the graph is directed , undirected , or bidirectional . By convention , a directed graph provides access to out - edges only , whereas a bidirectional graph provides access to in - edges as well as ...
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 |