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 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from
Boost.Grpah. Someone needs to update it, as it does NOT compile.
*/
#include <boost/graph/graphviz.hpp>
#include <boost/graph/depth_first_search.hpp>
char name[] = "abcdefghij";
struct parenthesis_visitor : public boost::default_dfs_visitor
{
template < class Vertex, class Graph >
void start_vertex(Vertex v, const Graph&)
{
std::cout << ' ';
}
template < class Vertex, class Graph >
void discover_vertex(Vertex v, const Graph&)
{
std::cout << "(" << name[v] << ' ';
}
template < class Vertex, class Graph >
void finish_vertex(Vertex v, const Graph&)
{
std::cout << ' ' << name[v] << ")";
}
};
int main()
{
using namespace boost;
GraphvizGraph g;
read_graphviz("figs/dfs-example.dot", g);
graph_traits< GraphvizGraph >::edge_iterator e, e_end;
for (boost::tie(e, e_end) = edges(g); e != e_end; ++e)
std::cout << '(' << name[source(*e, g)] << ' ' << name[target(*e, g)]
<< ')' << std::endl;
parenthesis_visitor paren_vis;
depth_first_search(g, visitor(paren_vis));
std::cout << std::endl;
return 0;
}
|
