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.
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.
Jeremy G. Siek is a doctoral candidate specializing in the construction of high-performance software libraries for scientific computing. Lie-Quan Lee, also a doctoral candidate, developed the first version of the BGL. His research interests include generic programming, scientific component libraries, high-performance computing for computational science and engineering, and scalable mathematical software. Andrew Lumsdaine, Professor of Computer Science at Indiana University, has been on sabbatical at Lawrence Berkeley National Laboratory working on generic graph algorithms.
