Главная
Study mode:
on
1
Introduction
2
Outline
3
What is generic programming
4
Objectoriented library design
5
Generic programming approach
6
Efficiency
7
Performance
8
Random Access Iterator
9
Bidirectional Iterators
10
The Flying Problem
11
General Concepts
12
Semantical Requirements
13
Concept Creation
14
Graph Structures
15
Graph Algorithms
16
Design Experiment
Description:
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. Read more

Generic Programming and the Boost Graph Library

CppNow
Add to list
0:00 / 0:00