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 41
... edges are manipulated through opaque handles called vertex descriptors and edge descriptors. Different graph types may use different types for their descriptors. For example, some graph types may use integers, whereas other graphs may ...
... edge can be printed using the following function: template <typename Graph, typename TransDelayMap, typename ... descriptor. 2. An edge iterator is used to traverse all the edges of a graph. The value type of this iterator is an edge ...
... 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 adjacent to as the source. 5. An adjacency ...
... edge descriptor for the new edge and the second is a Boolean flag that indicates whether an edge was added ( some graph types will not insert an edge if an edge with the same source and target is already in the graph ) . Add connections ...
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 |