Chapter 13. BGL Algorithms
13.1 Overview
This chapter provides in-depth information about how to use all of the graph algorithms in the Boost Graph Library.
The BGL generic algorithms are divided into the following categories:
- Basic search algorithms
- Shortest paths
- Minimum spanning tree
- Connected components
- Maximum flow
- Vertex ordering
All of the algorithms are implemented as function templates where the graph type is a template parameter. This allows the function to be used with any graph type that models the required concepts. The documentation for each algorithm lists the required graph concepts, and the documentation for each graph class lists the concepts that the graph models. By cross-referencing through the concepts one can determine ...
Get The Boost Graph Library: User Guide and Reference Manual now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
