1 //=======================================================================
2 // Copyright 2012
3 // Authors: David Doria
4 //
5 // Distributed under the Boost Software License, Version 1.0. (See
6 // accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //=======================================================================
9 
10 #include <boost/graph/directed_graph.hpp> // A subclass to provide reasonable arguments to adjacency_list for a typical directed graph
11 
main(int,char * [])12 int main(int,char*[])
13 {
14   // directed_graph is a subclass of adjacency_list which gives you object oriented access to functions
15   // like add_vertex and add_edge, which makes the code easier to understand. However, it hard codes many
16   // of the template parameters, so it is much less flexible.
17 
18   typedef boost::directed_graph<> Graph;
19   Graph g;
20   boost::graph_traits<Graph>::vertex_descriptor v0 = g.add_vertex();
21   boost::graph_traits<Graph>::vertex_descriptor v1 = g.add_vertex();
22 
23   g.add_edge(v0, v1);
24 
25   return 0;
26 }
27