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 91
... Concept Checking 2.5.1 Concept-Checking Classes 2.5.2 Concept Archetypes 2.6 The Boost Namespace 2.6.1 Classes 2.6.2 Koenig Lookup 2.7 Named Function Parameters 3. A BGL Tutorial 3.1 File Dependencies 3.2 Graph Setup 3.3 Compilation ...
... Concepts Notation 12.1 Graph Traversal Concepts 12.1.1 Undirected Graphs 12.1.2 Graph 12.1.3 IncidenceGraph 12.1.4 BidirectionalGraph 12.1.5 AdjacencyGraph 12.1.6 VertexListGraph 12.1.7 EdgeListGraph 12.1.8 AdjacencyMatrix 12.2 Graph ...
... concepts as a new interface facility . For example , we can define : concept SemiRegular : Assignable , DefaultConstructible { } ; concept Regular : SemiRegular , EqualityComparable { } ; concept InputIterator : Regular , Incrementable ...
... concepts and references to concepts ! Generic programming is a relatively young subdiscipline of computer science . I am happy to see that the small effort - started twenty years ago by Dave Musser , Deepak Kapur , Aaron Kershenbaum and ...
... concept. For example, OutputIterator merge(InputIterator[1] first1, InputIterator[1] last1, InputIterator[2] first2 ... concepts will unify both approaches and resolve both sets of limitations. And after all, it is possible to represent ...
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 |