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
14using namespace boost;
15
16template < typename Graph, typename VertexNamePropertyMap >
17void 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
40template < typename Graph, typename VertexNameMap >
41void output_adjacent_vertices(std::ostream& out,
42 typename graph_traits< Graph >::vertex_descriptor u, const Graph& g,
43 VertexNameMap name_map)
44{
45 typename graph_traits< Graph >::adjacency_iterator vi, vi_end;
46 out << get(name_map, u) << " -> { ";
47 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi)
48 out << get(name_map, *vi) << " ";
49 out << "}" << std::endl;
50}
51
52template < typename NameMap > class name_equals_t
53{
54public:
55 name_equals_t(const std::string& n, NameMap map)
56 : m_name(n), m_name_map(map)
57 {
58 }
59 template < typename Vertex > bool operator()(Vertex u) const
60 {
61 return get(m_name_map, u) == m_name;
62 }
63
64private:
65 std::string m_name;
66 NameMap m_name_map;
67};
68
69// object generator function
70template < typename NameMap >
71inline name_equals_t< NameMap > name_equals(
72 const std::string& str, NameMap name)
73{
74 return name_equals_t< NameMap >(str, name);
75}
76
77int main(int argc, const char** argv)
78{
79 typedef adjacency_list< listS, // Store out-edges of each vertex in a
80 // std::list
81 vecS, // Store vertex set in a std::vector
82 directedS, // The graph is directed
83 property< vertex_name_t, std::string > // Add a vertex property
84 >
85 graph_type;
86
87 graph_type g; // use default constructor to create empty graph
88 const char* dep_file_name
89 = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
90 const char* target_file_name
91 = argc >= 3 ? argv[2] : "makefile-target-names.dat";
92 std::ifstream file_in(dep_file_name), name_in(target_file_name);
93 if (!file_in)
94 {
95 std::cerr << "** Error: could not open file " << dep_file_name
96 << std::endl;
97 return -1;
98 }
99 if (!name_in)
100 {
101 std::cerr << "** Error: could not open file " << target_file_name
102 << std::endl;
103 return -1;
104 }
105 // Obtain internal property map from the graph
106 property_map< graph_type, vertex_name_t >::type name_map
107 = get(p: vertex_name, g);
108 read_graph_file(graph_in&: file_in, name_in, g, name_map);
109
110 graph_traits< graph_type >::vertex_iterator i, end;
111 boost::tie(t0&: i, t1&: end) = vertices(g_: g);
112 i = std::find_if(first: i, last: end, pred: name_equals(str: "dax.h", name: get(p: vertex_name, g)));
113 output_adjacent_vertices(out&: std::cout, u: *i, g, name_map: get(p: vertex_name, g));
114
115 assert(num_vertices(g) == 15);
116 assert(num_edges(g) == 19);
117 return 0;
118}
119

source code of boost/libs/graph/example/print-adjacent-vertices.cpp