Boost C++ Application Development Cookbook - Second Edition

How to do it...

In this recipe, we'll describe a graph type, create a graph of that type, add some vertexes and edges to the graph, and search for a specific vertex. That should be enough to start with Boost.Graph.

1. We start by describing the graph type:

#include <boost/graph/adjacency_list.hpp> 
#include <string> 
 
typedef std::string vertex_t; 
typedef boost::adjacency_list< 
    boost::vecS 
    , boost::vecS 
    , boost::bidirectionalS 
    , vertex_t 
> graph_type; 

2. Now, we construct it:

int main() {    graph_type graph; 

3. Let's carry out some undocumented trick that speeds up graph construction:

    static const std::size_t vertex_count = 5; 
    graph.m_vertices.reserve(vertex_count); 

4. Now, we are ready to add vertexes to the graph:

 typedef boost::graph_traits< ...