- Used Books
- Kobo eReading
- Staff Picks
- Gifts & Gift Cards
- Sell Books
- Stores & Events
Special Offers see all
More at Powell's
Recently Viewed clear list
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN
Other titles in the C++ in Depth series:
The Boost Graph Library: User Guide and Reference Manual with CDROM (C++ in Depth)by Jeremy G. Siek
Synopses & Reviews
“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:
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.
Book News Annotation:
The boost graph library (BGL) is the first C++ graph library to apply the notion of generic programming to the construction of graph algorithms. This book introduces the major features of BGL, applies the concepts to the solution of real-world problems, and documents all BGL algorithms and classes. The CD-ROM contains the complete source code of the BGL.
Annotation c. Book News, Inc., Portland, OR (booknews.com)
The first complete tutorial and reference on the Boost Graphic Library (BGL) — by its creators!
-- New graph data structures and algorithms that can help experienced C++ developers save time and dramatically improve code reliability and performance.
-- Practical new insights into generic programming — techniques you can use to build your own libraries!
-- CD-ROM includes complete electronic version of the book, in hyperlinked, searchable PDF format, as well as the BGL itself.
The Boost Graphic Library (BGL) gives experienced C++ developers high quality implementations of a wide range of graph data structures and algorithms — helping them save time that would otherwise have been spent on developing and debugging. Now, the BGL's creators offer a complete tutorial and reference designed to help developers get results with the BGL quickly. They also offer practical, hard-to-find guidance on generic programming that can help developers build their own software development libraries. For practicing programmers, the book introduces high quality implementations of graph data structures and algorithms that deliver outstanding efficiency and performance, and presents the BGL's flexible interface, which enables programmers to apply graph algorithms in settings where a graph may exist only implicitly. For all intermediate-to-advanced C++ programmers.
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.
Table of Contents
I User Guide.
Some Graph Terminology.
Vertex and Edge Descriptors.
Graph Construction and Modification
Graph Classes and Adaptors.
Generic Graph Algorithms.
The Topological Sort Generic Algorithm.
The Depth-First Search Generic Algorithm.
2.Generic Programming in C++.
Polymorphism in Object-Oriented Programming.
Polymorphism in Generic Programming.
Comparison of GP and OOP.
Generic Programming and the STL.
Concepts and Models.
Sets of Requirements.
Associated Types and Traits Classes.
Associated Types Needed in Function Template.
Typedefs Nested in Classes.
Definition of a Traits Class.
The Boost Namespace.
Named Function Parameters.
3. A BGL Tutorial.
Topological Sort via DFS.
Marking Vertices Using External Properties.
Accessing Adjacent Vertices.
Traversing All the Vertices.
Toward a Generic DFS: Visitors.
Graph Setup: Internal Properties.
A Generic Topological Sort and DFS.
Parallel Compilation Time.
4. Basic Graph Algorithms.
Six Degrees of Kevin Bacon.
Finding Loops in Program-Control-Flow Graphs.
5. Shortest-Paths Problems.
Bellman-Ford and Distance Vector Routing.
Dijkstra and Link-State Routing.
6. Minimum-Spanning-Tree Problem.
Telephone Network Planning.
7. Connected Components.
Connected Components and Internet Connectivity.
Strongly Connected Components and Web Page Links.
8. Maximum Flow.
9. Implicit Graphs: A Knight's Tour.
Knight's Jumps as a Graph.
Backtracking Graph Search.
10. Interfacing with Other Graph Libraries.
Using BGL Topological Sort with a LEDA Graph.
Using BGL Topological Sort with a SGB Graph.
Implementing Graph Adaptors.
11. Performance Guidelines.
Graph Class Comparisons.
The Results and Discussion.
II Reference Manual.
12. BGL Concepts.
Graph Traversal Concepts.
Graph Modification Concepts.
13. BGL Algorithms.
Static Connected Components.
Incremental Connected Components.
14. BGL Classes.
15. Property Map Library.
Property Map Concepts.
Property Map Classes.
Creating Your Own Property Maps.
Property Maps for Stanford GraphBase.
A Property Map Implemented with std::map.
16 Auxiliary Concepts, Classes, and Functions.
What Our Readers Are Saying
Other books you might like