Generic Programming and the Boost Graph Library

Explore generic programming principles and their application in the Boost Graph Library (BGL) through this comprehensive CppNow conference talk. Delve into the flexibility and efficiency of graph algorithms and data structures for solving diverse problems in areas like Internet packet routing, molecular biology, and scientific computing. Learn how the Generic Programming methodology, pioneered by Stepanov and Musser, overcomes traditional graph library design limitations. Gain insights into the BGL's design, underlying principles, and C++ template techniques used in implementing generic libraries. Apply BGL to practical programming problems, understanding how to leverage its power and flexibility. For developers interested in creating generic libraries, examine this valuable example of applying generic programming beyond classical STL sequence algorithms. Cover topics including object-oriented library design, efficiency considerations, iterator types, concept creation, graph structures, and algorithms through hands-on design experiments.

Introduction
Outline
What is generic programming
Objectoriented library design
Generic programming approach
Efficiency
Performance
Random Access Iterator
Bidirectional Iterators
The Flying Problem
General Concepts
Semantical Requirements
Concept Creation
Graph Structures
Graph Algorithms
Design Experiment