1 //=======================================================================
2 // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
3 //
4 // Distributed under the Boost Software License, Version 1.0. (See
5 // accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt)
7 //=======================================================================
8 #include <boost/config.hpp>
9 #include <fstream>
10 #include <boost/graph/adjacency_list.hpp>
11
12 using namespace boost;
13
read_graph_file(std::istream & in,Graph & g)14 template < typename Graph > void read_graph_file(std::istream& in, Graph& g)
15 {
16 typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
17 typedef typename graph_traits< Graph >::vertices_size_type size_type;
18 size_type n_vertices;
19 in >> n_vertices; // read in number of vertices
20 std::vector< Vertex > vertex_set(n_vertices);
21 for (size_type i = 0; i < n_vertices; ++i)
22 vertex_set[i] = add_vertex(g);
23
24 size_type u, v;
25 while (in >> u)
26 if (in >> v)
27 add_edge(vertex_set[u], vertex_set[v], g);
28 else
29 break;
30 }
31
main(int argc,const char ** argv)32 int main(int argc, const char** argv)
33 {
34 typedef adjacency_list< listS, // Store out-edges of each vertex in a
35 // std::list
36 vecS, // Store vertex set in a std::vector
37 directedS // The graph is directed
38 >
39 graph_type;
40
41 graph_type g; // use default constructor to create empty graph
42 std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
43 read_graph_file(file_in, g);
44
45 assert(num_vertices(g) == 15);
46 assert(num_edges(g) == 19);
47 return 0;
48 }
49