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 * [])12int main(int, char*[]) 13 { 14 // directed_graph is a subclass of adjacency_list which gives you object 15 // oriented access to functions like add_vertex and add_edge, which makes 16 // the code easier to understand. However, it hard codes many of the 17 // template parameters, so it is much less flexible. 18 19 typedef boost::directed_graph<> Graph; 20 Graph g; 21 boost::graph_traits< Graph >::vertex_descriptor v0 = g.add_vertex(); 22 boost::graph_traits< Graph >::vertex_descriptor v1 = g.add_vertex(); 23 24 g.add_edge(v0, v1); 25 26 return 0; 27 } 28