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 <iostream>
10 #include <fstream>
11 #include <string>
12 #include <boost/graph/adjacency_list.hpp>
13
14 using namespace boost;
15
16 template < typename Graph, typename VertexNamePropertyMap >
read_graph_file(std::istream & graph_in,std::istream & name_in,Graph & g,VertexNamePropertyMap name_map)17 void read_graph_file(std::istream& graph_in, std::istream& name_in, Graph& g,
18 VertexNamePropertyMap name_map)
19 {
20 typedef typename graph_traits< Graph >::vertices_size_type size_type;
21 size_type n_vertices;
22 typename graph_traits< Graph >::vertex_descriptor u;
23 typename property_traits< VertexNamePropertyMap >::value_type name;
24
25 graph_in >> n_vertices; // read in number of vertices
26 for (size_type i = 0; i < n_vertices; ++i)
27 { // Add n vertices to the graph
28 u = add_vertex(g);
29 name_in >> name;
30 put(name_map, u, name); // ** Attach name property to vertex u **
31 }
32 size_type src, targ;
33 while (graph_in >> src) // Read in edges
34 if (graph_in >> targ)
35 add_edge(src, targ, g); // add an edge to the graph
36 else
37 break;
38 }
39
main(int argc,const char ** argv)40 int main(int argc, const char** argv)
41 {
42 typedef adjacency_list< listS, // Store out-edges of each vertex in a
43 // std::list
44 vecS, // Store vertex set in a std::vector
45 directedS, // The graph is directed
46 property< vertex_name_t, std::string > // Add a vertex property
47 >
48 graph_type;
49
50 graph_type g; // use default constructor to create empty graph
51 const char* dep_file_name
52 = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
53 const char* target_file_name
54 = argc >= 3 ? argv[2] : "makefile-target-names.dat";
55 std::ifstream file_in(dep_file_name), name_in(target_file_name);
56 if (!file_in)
57 {
58 std::cerr << "** Error: could not open file " << dep_file_name
59 << std::endl;
60 return -1;
61 }
62 if (!name_in)
63 {
64 std::cerr << "** Error: could not open file " << target_file_name
65 << std::endl;
66 return -1;
67 }
68
69 // Obtain internal property map from the graph
70 property_map< graph_type, vertex_name_t >::type name_map
71 = get(vertex_name, g);
72 read_graph_file(file_in, name_in, g, name_map);
73
74 // Create storage for last modified times
75 std::vector< time_t > last_mod_vec(num_vertices(g));
76 // Create nickname for the property map type
77 typedef iterator_property_map< std::vector< time_t >::iterator,
78 property_map< graph_type, vertex_index_t >::type, time_t, time_t& >
79 iter_map_t;
80 // Create last modified time property map
81 iter_map_t mod_time_map(last_mod_vec.begin(), get(vertex_index, g));
82
83 assert(num_vertices(g) == 15);
84 assert(num_edges(g) == 19);
85 return 0;
86 }
87