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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
// Copyright 2008-2010 Gordon Woodhull
// 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/msm/mpl_graph/depth_first_search.hpp>
#include <boost/msm/mpl_graph/adjacency_list_graph.hpp>
#include <boost/msm/mpl_graph/incidence_list_graph.hpp>
#include <iostream>
namespace mpl_graph = boost::msm::mpl_graph;
namespace mpl = boost::mpl;
// vertices
struct A{}; struct B{}; struct C{}; struct D{}; struct E{}; struct F{}; struct G{};
// edges
struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{};
/*
incidence list test graph:
A -> B -> C -\--> D
\ |--> E
\ \--> F
\-----/
G
*/
typedef mpl::vector<mpl::vector<A_B,A,B>,
mpl::vector<B_C,B,C>,
mpl::vector<C_D,C,D>,
mpl::vector<C_E,C,E>,
mpl::vector<C_F,C,F>,
mpl::vector<B_F,B,F> >
some_incidence_list;
typedef mpl_graph::incidence_list_graph<some_incidence_list> some_incidence_list_graph;
/*
adjacency list test graph:
A -> B -> C -\--> D
\ |--> E
\ \--> F
\-----/
G
*/
typedef mpl::vector<
mpl::pair<A, mpl::vector<mpl::pair<A_B, B> > >,
mpl::pair<B, mpl::vector<mpl::pair<B_C, C>,
mpl::pair<B_F, F> > >,
mpl::pair<C, mpl::vector<mpl::pair<C_D, D>,
mpl::pair<C_E, E>,
mpl::pair<C_F, F> > >,
mpl::pair<G, mpl::vector<> > >
some_adjacency_list;
typedef mpl_graph::adjacency_list_graph<some_adjacency_list> some_adjacency_list_graph;
struct preordering_visitor : mpl_graph::dfs_default_visitor_operations {
template<typename Node, typename Graph, typename State>
struct discover_vertex :
mpl::push_back<State, Node>
{};
};
struct postordering_visitor : mpl_graph::dfs_default_visitor_operations {
template<typename Node, typename Graph, typename State>
struct finish_vertex :
mpl::push_back<State, Node>
{};
};
// adjacency list tests
// preordering, default start node (first)
typedef mpl::first<mpl_graph::
depth_first_search_all<some_adjacency_list_graph,
preordering_visitor,
mpl::vector<> >::type>::type
preorder_adj;
BOOST_MPL_ASSERT(( mpl::equal<preorder_adj::type, mpl::vector<A,B,C,D,E,F,G> > ));
// postordering, default start node
typedef mpl::first<mpl_graph::
depth_first_search_all<some_adjacency_list_graph,
postordering_visitor,
mpl::vector<> >::type>::type
postorder_adj;
BOOST_MPL_ASSERT(( mpl::equal<postorder_adj::type, mpl::vector<D,E,F,C,B,A,G> > ));
// preordering all starting at C
typedef mpl::first<mpl_graph::
depth_first_search_all<some_adjacency_list_graph,
preordering_visitor,
mpl::vector<>,
C>::type>::type
preorder_adj_all_from_c;
BOOST_MPL_ASSERT(( mpl::equal<preorder_adj_all_from_c::type, mpl::vector<C,D,E,F,A,B,G> > ));
// preordering just those starting at C
typedef mpl::first<mpl_graph::
depth_first_search<some_adjacency_list_graph,
preordering_visitor,
mpl::vector<>,
C>::type>::type
preorder_adj_from_c;
BOOST_MPL_ASSERT(( mpl::equal<preorder_adj_from_c::type, mpl::vector<C,D,E,F> > ));
// incidence list tests
// preordering, default start node (first)
typedef mpl::first<mpl_graph::
depth_first_search_all<some_incidence_list_graph,
preordering_visitor,
mpl::vector<> >::type>::type
preorder_inc;
BOOST_MPL_ASSERT(( mpl::equal<preorder_inc::type, mpl::vector<A,B,C,D,E,F> > ));
// postordering, default start node
typedef mpl::first<mpl_graph::
depth_first_search_all<some_incidence_list_graph,
postordering_visitor,
mpl::vector<> >::type>::type
postorder_inc;
BOOST_MPL_ASSERT(( mpl::equal<postorder_inc::type, mpl::vector<D,E,F,C,B,A> > ));
// preordering starting at C
typedef mpl::first<mpl_graph::
depth_first_search_all<some_incidence_list_graph,
preordering_visitor,
mpl::vector<>,
C>::type>::type
preorder_inc_all_from_c;
BOOST_MPL_ASSERT(( mpl::equal<preorder_inc_all_from_c::type, mpl::vector<C,D,E,F,A,B> > ));
// preordering starting at B
typedef mpl::first<mpl_graph::
depth_first_search<some_incidence_list_graph,
preordering_visitor,
mpl::vector<>,
B>::type>::type
preorder_inc_from_b;
BOOST_MPL_ASSERT(( mpl::equal<preorder_inc_from_b::type, mpl::vector<B,C,D,E,F> > ));
int main() {
return 0;
}
|
