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
54
55
56
57
|
//=======================================================================
// Copyright 2002 Indiana University.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// 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)
//=======================================================================
#include <boost/concept_archetype.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/graph_archetypes.hpp>
int main()
{
using namespace boost;
typedef default_constructible_archetype<
sgi_assignable_archetype< equality_comparable_archetype<> > >
vertex_t;
{
typedef incidence_graph_archetype< vertex_t, directed_tag,
allow_parallel_edge_tag >
IncidenceGraph;
typedef vertex_list_graph_archetype< vertex_t, directed_tag,
allow_parallel_edge_tag, IncidenceGraph >
graph_t;
graph_t& g = static_object< graph_t >::get();
read_write_property_map_archetype< vertex_t, color_value_archetype >
color;
depth_first_search(g, color_map(color));
}
{
typedef incidence_graph_archetype< vertex_t, directed_tag,
allow_parallel_edge_tag >
IncidenceGraph;
typedef vertex_list_graph_archetype< vertex_t, directed_tag,
allow_parallel_edge_tag, IncidenceGraph >
graph_t;
graph_t& g = static_object< graph_t >::get();
readable_property_map_archetype< vertex_t, std::size_t > v_index;
depth_first_search(g, vertex_index_map(v_index));
}
{
typedef incidence_graph_archetype< vertex_t, undirected_tag,
allow_parallel_edge_tag >
IncidenceGraph;
typedef vertex_list_graph_archetype< vertex_t, undirected_tag,
allow_parallel_edge_tag, IncidenceGraph >
Graph;
typedef property_graph_archetype< Graph, vertex_index_t, std::size_t >
graph_t;
graph_t& g = static_object< graph_t >::get();
dfs_visitor<> v;
depth_first_search(g, visitor(v));
}
return 0;
}
|
