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 68
... 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 ... out-edge of vertex u and an in-edge of vertex v. For an undirected graph, edge (u, v) is said to be incident on the ...
... out-edges, in-edges, and adjacent vertices for each vertex. Similar to the STL, the BGL uses iterators to provide access to each of these collections. There are five kinds of graph iterators, one for each kind of collection: 1. A vertex ...
... vertices. The output of this function for the graph of Figure 1.1 is trans - delay ( a ... edges ( ) functions , there are out_edges ( ) , in_edges ( ) , and ... out which operation was missing . See §2.5 for more details . The available ...
... vertices where , with each vertex , there is stored a collection of out - edges . The actual implementation of the collection of vertices and edges can vary to meet particular needs . The adjacency_list class has several template ...
... edge directions of a directed graph on the fly , so that in - edges behave like out - edges , and vice versa . • filtered_graph is an adaptor that creates a view of a graph where two predicate function objects control whether vertices and ...
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 |