ost.png" alt="C++ Boost" width="277" height="86"><br clear>
<h1>A Quick Tour of the Boost Graph Library</h1>
<p>The domain of graph data structures and algorithms is in some respects more
complicated than that of containers. The abstract iterator interface used by STL
is not sufficiently rich to encompass the numerous ways that graph algorithms
may traverse a graph. Instead, we formulate an abstract interface that serves
the same purpose for graphs that iterators do for basic containers (though
iterators st