The following libraries provide algorithms that complement the algorithms from the standard library.
Boost.Algorithm collects and provides useful algorithms.
Boost.Range also provides algorithms, but more important, it defines a new concept called range, which should make using algorithms easier.
Boost.Graph is specialized for graphs and provides algorithms such as finding the shortest path between two points.
A few libraries that contain algorithms are introduced in other parts of the book. For example, you will find algorithms for strings in the library Boost.StringAlgorithms, which is introduced in Part II