The Boost Graph Library: User Guide and Reference Manual (AW C++ in depth) - Softcover

Siek / Lee / Lumsdaine, Jeremy G. Siek / Lie-Quan Lee / Andrew Lumsdaine

Softcover

ISBN 10: 0201729148 ISBN 13: 9780201729146

Publisher: Addison-Wesley Professional, 2001

Synopsis

This user guide and reference manual provides practical insights into generic programming - techniques which can be used to build your own libraries. The CD-ROM includes a complete electronic version of the book, in hyperlinked, searchable PDF format, as well as the BGL itself.

About this title

From the Back Cover

“This book is unique because it discusses graph algorithms in terms of generic programming, and because it presents a concrete, usable library that embodies those algorithms.”—Matthew H. Austern, AT & T Labs-Research

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:

Graph terminology and concepts

Generic programming techniques in C++

Shortest-path algorithms for Internet routing

Network planning problems using the minimum-spanning tree algorithms

BGL algorithms with implicitly defined graphs

BGL Interfaces to other graph libraries

BGL concepts and algorithms

BGL classes—graph, auxiliary, and adaptor

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.

0201729148B11212001

About the Author

Jeremy G. Siek is a leading expert in C++ and generic programming and is currently pursuing his doctoral degree at Indiana University. He is interested in the design of programming languages that support generic programming and in high performance libraries. Jeremy is a member of the ISO C++ Standards Committee and is an active member of the Boost C++ Library Group, where he has contributed several libraries in addition to the BGL.

Lie-Quan (Rich) Lee developed the first version of the BGL. A doctoral candidate at the University of Notre Dame, his research interests include generic programming, scientific component libraries, and high performance computing. Rich is an active member of the Boost C++ Library Group.

Andrew Lumsdaine is an Associate Professor in the Computer Science Department and Associate Director of the Open Systems Laboratory at Indiana University. In addition to generic programming and software engineering, his research program includes projects in computational science and engineering, parallel and distributed computing, mathematical software, and numerical analysis. Andrew is a member of the ISO C++ Standards Committee and the Boost C++ Library Group.

0201729148AB11212001

Edition details

• Publisher: Addison-Wesley Professional
• Publication date: 2001
• ISBN 10: 0201729148
• ISBN 13: 9780201729146
• Binding: Paperback
• Language: English
• Edition number: 1
• Number of pages: 346