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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
// Copyright (C) 2009 Andrew Sutton
//
// Use, modification and distribution is subject to 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)
#ifndef BOOST_GRAPH_MUTABILITY_TRAITS_HPP
#define BOOST_GRAPH_MUTABILITY_TRAITS_HPP
#include <boost/config.hpp>
#include <boost/mpl/if.hpp>
#include <boost/mpl/and.hpp>
#include <boost/mpl/bool.hpp>
#include <boost/type_traits/is_same.hpp>
namespace boost {
// The mutabiltiy categories classify graphs by their mutating operations
// on the edge and vertex sets. This is a substantially more refined
// categorization than the MutableGraph and MutablePropertyGraph denote.
// Currently, this framework is only used in the graph tests to help
// dispatch test to the correct places. However, there are probably some
// constructive or destructive algorithms (i.e., graph generators) that
// may use these to describe requirements on graph inputs.
struct add_vertex_tag { };
struct add_vertex_property_tag : virtual add_vertex_tag { };
struct add_edge_tag { };
struct add_edge_property_tag : virtual add_edge_tag { };
struct remove_vertex_tag { };
struct remove_edge_tag { };
struct mutable_vertex_graph_tag
: virtual add_vertex_tag, virtual remove_vertex_tag
{ };
struct mutable_vertex_property_graph_tag
: virtual add_vertex_property_tag, virtual remove_vertex_tag
{ };
struct mutable_edge_graph_tag
: virtual add_edge_tag, virtual remove_edge_tag
{ };
struct mutable_edge_property_graph_tag
: virtual add_edge_property_tag, virtual remove_edge_tag
{ };
struct mutable_graph_tag
: virtual mutable_vertex_graph_tag
, virtual mutable_edge_graph_tag
{ };
struct mutable_property_graph_tag
: virtual mutable_vertex_property_graph_tag
, virtual mutable_edge_property_graph_tag
{ };
// Some graphs just don't like to be torn down. Note this only restricts
// teardown to the set of vertices, not the vertex set.
// TODO: Find a better name for this tag.
struct add_only_property_graph_tag
: virtual add_vertex_property_tag
, virtual mutable_edge_property_graph_tag
{ };
/**
* The graph_mutability_traits provide methods for determining the
* interfaces supported by graph classes for adding and removing vertices
* and edges.
*/
template <typename Graph>
struct graph_mutability_traits {
typedef typename Graph::mutability_category category;
};
template <typename Graph>
struct graph_has_add_vertex
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
add_vertex_tag
>::value
>
{ };
template <typename Graph>
struct graph_has_add_vertex_with_property
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
add_vertex_property_tag
>::value
>
{ };
template <typename Graph>
struct graph_has_remove_vertex
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
remove_vertex_tag
>::value
>
{ };
template <typename Graph>
struct graph_has_add_edge
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
add_edge_tag
>::value
>
{ };
template <typename Graph>
struct graph_has_add_edge_with_property
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
add_edge_property_tag
>::value
>
{ };
template <typename Graph>
struct graph_has_remove_edge
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
remove_edge_tag
>::value
>
{ };
template <typename Graph>
struct is_mutable_vertex_graph
: mpl::and_<
graph_has_add_vertex<Graph>,
graph_has_remove_vertex<Graph>
>
{ };
template <typename Graph>
struct is_mutable_vertex_property_graph
: mpl::and_<
graph_has_add_vertex_with_property<Graph>,
graph_has_remove_vertex<Graph>
>
{ };
template <typename Graph>
struct is_mutable_edge_graph
: mpl::and_<
graph_has_add_edge<Graph>,
graph_has_remove_edge<Graph>
>
{ };
template <typename Graph>
struct is_mutable_edge_property_graph
: mpl::and_<
graph_has_add_edge_with_property<Graph>,
graph_has_remove_edge<Graph>
>
{ };
template <typename Graph>
struct is_mutable_graph
: mpl::and_<
is_mutable_vertex_graph<Graph>,
is_mutable_edge_graph<Graph>
>
{ };
template <typename Graph>
struct is_mutable_property_graph
: mpl::and_<
is_mutable_vertex_property_graph<Graph>,
is_mutable_edge_property_graph<Graph>
>
{ };
template <typename Graph>
struct is_add_only_property_graph
: mpl::bool_<
is_convertible<
typename graph_mutability_traits<Graph>::category,
add_only_property_graph_tag
>::value
>
{ };
/** @name Mutability Traits Specializations */
//@{
//@}
} // namespace boost
#endif
|
