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 <boost/graph/transpose_graph.hpp>
11 #include <boost/graph/adjacency_list.hpp>
12 #include <boost/graph/graph_utility.hpp>
13
14 int
main()15 main()
16 {
17 using namespace boost;
18 typedef int weight_t;
19 typedef adjacency_list < vecS, vecS, bidirectionalS,
20 property < vertex_name_t, char > > graph_t;
21
22 enum { a, b, c, d, e, f, g, N };
23 graph_t G(N);
24 property_map < graph_t, vertex_name_t >::type
25 name_map = get(vertex_name, G);
26 char name = 'a';
27 graph_traits < graph_t >::vertex_iterator v, v_end;
28 for (boost::tie(v, v_end) = vertices(G); v != v_end; ++v, ++name)
29 name_map[*v] = name;
30
31 typedef std::pair < int, int >E;
32 E edge_array[] = { E(a, c), E(a, d), E(b, a), E(b, d), E(c, f),
33 E(d, c), E(d, e), E(d, f), E(e, b), E(e, g), E(f, e), E(f, g)
34 };
35 for (int i = 0; i < 12; ++i)
36 add_edge(edge_array[i].first, edge_array[i].second, G);
37
38 print_graph(G, name_map);
39 std::cout << std::endl;
40
41 graph_t G_T;
42 transpose_graph(G, G_T);
43
44 print_graph(G_T, name_map);
45
46 graph_traits < graph_t >::edge_iterator ei, ei_end;
47 for (boost::tie(ei, ei_end) = edges(G); ei != ei_end; ++ei)
48 assert(edge(target(*ei, G), source(*ei, G), G_T).second == true);
49 return 0;
50 }
51