1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
// Copyright (c) Jeremy Siek 2001
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appears in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation. Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose. It is provided "as is" without express or implied warranty.
// NOTE: this final is generated by libs/graph/doc/transitive_closure.w
#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
#error The transitive closure algorithm uses partial specialization.
#endif
#include <boost/graph/transitive_closure.hpp>
#include <boost/graph/graphviz.hpp>
int
main(int, char *[])
{
using namespace boost;
typedef property < vertex_name_t, char >Name;
typedef property < vertex_index_t, std::size_t, Name > Index;
typedef adjacency_list < listS, listS, directedS, Index > graph_t;
typedef graph_traits < graph_t >::vertex_descriptor vertex_t;
graph_t G;
std::vector < vertex_t > verts(4);
for (int i = 0; i < 4; ++i)
verts[i] = add_vertex(Index(i, Name('a' + i)), G);
add_edge(verts[1], verts[2], G);
add_edge(verts[1], verts[3], G);
add_edge(verts[2], verts[1], G);
add_edge(verts[3], verts[2], G);
add_edge(verts[3], verts[0], G);
std::cout << "Graph G:" << std::endl;
print_graph(G, get(vertex_name, G));
adjacency_list <> TC;
transitive_closure(G, TC);
std::cout << std::endl << "Graph G+:" << std::endl;
char name[] = "abcd";
print_graph(TC, name);
std::cout << std::endl;
std::ofstream out("tc-out.dot");
write_graphviz(out, TC, make_label_writer(name));
return 0;
}
|
