williamr@2
|
1 |
//
|
williamr@2
|
2 |
//=======================================================================
|
williamr@2
|
3 |
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
williamr@2
|
4 |
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
williamr@2
|
5 |
//
|
williamr@2
|
6 |
// Distributed under the Boost Software License, Version 1.0. (See
|
williamr@2
|
7 |
// accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
8 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
9 |
//=======================================================================
|
williamr@2
|
10 |
//
|
williamr@2
|
11 |
#ifndef BOOST_GRAPH_UNDIRECTED_DFS_HPP
|
williamr@2
|
12 |
#define BOOST_GRAPH_UNDIRECTED_DFS_HPP
|
williamr@2
|
13 |
|
williamr@2
|
14 |
#include <boost/graph/depth_first_search.hpp>
|
williamr@2
|
15 |
#include <vector>
|
williamr@2
|
16 |
|
williamr@2
|
17 |
namespace boost {
|
williamr@2
|
18 |
|
williamr@2
|
19 |
namespace detail {
|
williamr@2
|
20 |
|
williamr@2
|
21 |
// Define BOOST_RECURSIVE_DFS to use older, recursive version.
|
williamr@2
|
22 |
// It is retained for a while in order to perform performance
|
williamr@2
|
23 |
// comparison.
|
williamr@2
|
24 |
#ifndef BOOST_RECURSIVE_DFS
|
williamr@2
|
25 |
|
williamr@2
|
26 |
template <typename IncidenceGraph, typename DFSVisitor,
|
williamr@2
|
27 |
typename VertexColorMap, typename EdgeColorMap>
|
williamr@2
|
28 |
void undir_dfv_impl
|
williamr@2
|
29 |
(const IncidenceGraph& g,
|
williamr@2
|
30 |
typename graph_traits<IncidenceGraph>::vertex_descriptor u,
|
williamr@2
|
31 |
DFSVisitor& vis,
|
williamr@2
|
32 |
VertexColorMap vertex_color,
|
williamr@2
|
33 |
EdgeColorMap edge_color)
|
williamr@2
|
34 |
{
|
williamr@2
|
35 |
function_requires<IncidenceGraphConcept<IncidenceGraph> >();
|
williamr@2
|
36 |
function_requires<DFSVisitorConcept<DFSVisitor, IncidenceGraph> >();
|
williamr@2
|
37 |
typedef typename graph_traits<IncidenceGraph>::vertex_descriptor Vertex;
|
williamr@2
|
38 |
typedef typename graph_traits<IncidenceGraph>::edge_descriptor Edge;
|
williamr@2
|
39 |
function_requires<ReadWritePropertyMapConcept<VertexColorMap,Vertex> >();
|
williamr@2
|
40 |
function_requires<ReadWritePropertyMapConcept<EdgeColorMap,Edge> >();
|
williamr@2
|
41 |
typedef typename property_traits<VertexColorMap>::value_type ColorValue;
|
williamr@2
|
42 |
typedef typename property_traits<EdgeColorMap>::value_type EColorValue;
|
williamr@2
|
43 |
function_requires< ColorValueConcept<ColorValue> >();
|
williamr@2
|
44 |
function_requires< ColorValueConcept<EColorValue> >();
|
williamr@2
|
45 |
typedef color_traits<ColorValue> Color;
|
williamr@2
|
46 |
typedef color_traits<EColorValue> EColor;
|
williamr@2
|
47 |
typedef typename graph_traits<IncidenceGraph>::out_edge_iterator Iter;
|
williamr@2
|
48 |
typedef std::pair<Vertex, std::pair<Iter, Iter> > VertexInfo;
|
williamr@2
|
49 |
|
williamr@2
|
50 |
std::vector<VertexInfo> stack;
|
williamr@2
|
51 |
|
williamr@2
|
52 |
put(vertex_color, u, Color::gray());
|
williamr@2
|
53 |
vis.discover_vertex(u, g);
|
williamr@2
|
54 |
stack.push_back(std::make_pair(u, out_edges(u, g)));
|
williamr@2
|
55 |
while (!stack.empty()) {
|
williamr@2
|
56 |
VertexInfo& back = stack.back();
|
williamr@2
|
57 |
u = back.first;
|
williamr@2
|
58 |
Iter ei, ei_end;
|
williamr@2
|
59 |
tie(ei, ei_end) = back.second;
|
williamr@2
|
60 |
stack.pop_back();
|
williamr@2
|
61 |
while (ei != ei_end) {
|
williamr@2
|
62 |
Vertex v = target(*ei, g);
|
williamr@2
|
63 |
vis.examine_edge(*ei, g);
|
williamr@2
|
64 |
ColorValue v_color = get(vertex_color, v);
|
williamr@2
|
65 |
EColorValue uv_color = get(edge_color, *ei);
|
williamr@2
|
66 |
put(edge_color, *ei, EColor::black());
|
williamr@2
|
67 |
if (v_color == Color::white()) {
|
williamr@2
|
68 |
vis.tree_edge(*ei, g);
|
williamr@2
|
69 |
stack.push_back(std::make_pair(u, std::make_pair(++ei, ei_end)));
|
williamr@2
|
70 |
u = v;
|
williamr@2
|
71 |
put(vertex_color, u, Color::gray());
|
williamr@2
|
72 |
vis.discover_vertex(u, g);
|
williamr@2
|
73 |
tie(ei, ei_end) = out_edges(u, g);
|
williamr@2
|
74 |
} else if (v_color == Color::gray()) {
|
williamr@2
|
75 |
if (uv_color == EColor::white()) vis.back_edge(*ei, g);
|
williamr@2
|
76 |
++ei;
|
williamr@2
|
77 |
} else { // if (v_color == Color::black())
|
williamr@2
|
78 |
++ei;
|
williamr@2
|
79 |
}
|
williamr@2
|
80 |
}
|
williamr@2
|
81 |
put(vertex_color, u, Color::black());
|
williamr@2
|
82 |
vis.finish_vertex(u, g);
|
williamr@2
|
83 |
}
|
williamr@2
|
84 |
}
|
williamr@2
|
85 |
|
williamr@2
|
86 |
#else // BOOST_RECURSIVE_DFS
|
williamr@2
|
87 |
|
williamr@2
|
88 |
template <typename IncidenceGraph, typename DFSVisitor,
|
williamr@2
|
89 |
typename VertexColorMap, typename EdgeColorMap>
|
williamr@2
|
90 |
void undir_dfv_impl
|
williamr@2
|
91 |
(const IncidenceGraph& g,
|
williamr@2
|
92 |
typename graph_traits<IncidenceGraph>::vertex_descriptor u,
|
williamr@2
|
93 |
DFSVisitor& vis, // pass-by-reference here, important!
|
williamr@2
|
94 |
VertexColorMap vertex_color,
|
williamr@2
|
95 |
EdgeColorMap edge_color)
|
williamr@2
|
96 |
{
|
williamr@2
|
97 |
function_requires<IncidenceGraphConcept<IncidenceGraph> >();
|
williamr@2
|
98 |
function_requires<DFSVisitorConcept<DFSVisitor, IncidenceGraph> >();
|
williamr@2
|
99 |
typedef typename graph_traits<IncidenceGraph>::vertex_descriptor Vertex;
|
williamr@2
|
100 |
typedef typename graph_traits<IncidenceGraph>::edge_descriptor Edge;
|
williamr@2
|
101 |
function_requires<ReadWritePropertyMapConcept<VertexColorMap,Vertex> >();
|
williamr@2
|
102 |
function_requires<ReadWritePropertyMapConcept<EdgeColorMap,Edge> >();
|
williamr@2
|
103 |
typedef typename property_traits<VertexColorMap>::value_type ColorValue;
|
williamr@2
|
104 |
typedef typename property_traits<EdgeColorMap>::value_type EColorValue;
|
williamr@2
|
105 |
function_requires< ColorValueConcept<ColorValue> >();
|
williamr@2
|
106 |
function_requires< ColorValueConcept<EColorValue> >();
|
williamr@2
|
107 |
typedef color_traits<ColorValue> Color;
|
williamr@2
|
108 |
typedef color_traits<EColorValue> EColor;
|
williamr@2
|
109 |
typename graph_traits<IncidenceGraph>::out_edge_iterator ei, ei_end;
|
williamr@2
|
110 |
|
williamr@2
|
111 |
put(vertex_color, u, Color::gray()); vis.discover_vertex(u, g);
|
williamr@2
|
112 |
for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) {
|
williamr@2
|
113 |
Vertex v = target(*ei, g); vis.examine_edge(*ei, g);
|
williamr@2
|
114 |
ColorValue v_color = get(vertex_color, v);
|
williamr@2
|
115 |
EColorValue uv_color = get(edge_color, *ei);
|
williamr@2
|
116 |
put(edge_color, *ei, EColor::black());
|
williamr@2
|
117 |
if (v_color == Color::white()) { vis.tree_edge(*ei, g);
|
williamr@2
|
118 |
undir_dfv_impl(g, v, vis, vertex_color, edge_color);
|
williamr@2
|
119 |
} else if (v_color == Color::gray() && uv_color == EColor::white())
|
williamr@2
|
120 |
vis.back_edge(*ei, g);
|
williamr@2
|
121 |
}
|
williamr@2
|
122 |
put(vertex_color, u, Color::black()); vis.finish_vertex(u, g);
|
williamr@2
|
123 |
}
|
williamr@2
|
124 |
|
williamr@2
|
125 |
#endif // ! BOOST_RECURSIVE_DFS
|
williamr@2
|
126 |
|
williamr@2
|
127 |
} // namespace detail
|
williamr@2
|
128 |
|
williamr@2
|
129 |
template <typename Graph, typename DFSVisitor,
|
williamr@2
|
130 |
typename VertexColorMap, typename EdgeColorMap,
|
williamr@2
|
131 |
typename Vertex>
|
williamr@2
|
132 |
void
|
williamr@2
|
133 |
undirected_dfs(const Graph& g, DFSVisitor vis,
|
williamr@2
|
134 |
VertexColorMap vertex_color, EdgeColorMap edge_color,
|
williamr@2
|
135 |
Vertex start_vertex)
|
williamr@2
|
136 |
{
|
williamr@2
|
137 |
function_requires<DFSVisitorConcept<DFSVisitor, Graph> >();
|
williamr@2
|
138 |
function_requires<EdgeListGraphConcept<Graph> >();
|
williamr@2
|
139 |
|
williamr@2
|
140 |
typedef typename property_traits<VertexColorMap>::value_type ColorValue;
|
williamr@2
|
141 |
typedef color_traits<ColorValue> Color;
|
williamr@2
|
142 |
|
williamr@2
|
143 |
typename graph_traits<Graph>::vertex_iterator ui, ui_end;
|
williamr@2
|
144 |
for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) {
|
williamr@2
|
145 |
put(vertex_color, *ui, Color::white()); vis.initialize_vertex(*ui, g);
|
williamr@2
|
146 |
}
|
williamr@2
|
147 |
typename graph_traits<Graph>::edge_iterator ei, ei_end;
|
williamr@2
|
148 |
for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
|
williamr@2
|
149 |
put(edge_color, *ei, Color::white());
|
williamr@2
|
150 |
|
williamr@2
|
151 |
if (start_vertex != *vertices(g).first){ vis.start_vertex(start_vertex, g);
|
williamr@2
|
152 |
detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color);
|
williamr@2
|
153 |
}
|
williamr@2
|
154 |
|
williamr@2
|
155 |
for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) {
|
williamr@2
|
156 |
ColorValue u_color = get(vertex_color, *ui);
|
williamr@2
|
157 |
if (u_color == Color::white()) { vis.start_vertex(*ui, g);
|
williamr@2
|
158 |
detail::undir_dfv_impl(g, *ui, vis, vertex_color, edge_color);
|
williamr@2
|
159 |
}
|
williamr@2
|
160 |
}
|
williamr@2
|
161 |
}
|
williamr@2
|
162 |
|
williamr@2
|
163 |
template <typename Graph, typename DFSVisitor, typename VertexColorMap,
|
williamr@2
|
164 |
typename EdgeColorMap>
|
williamr@2
|
165 |
void
|
williamr@2
|
166 |
undirected_dfs(const Graph& g, DFSVisitor vis,
|
williamr@2
|
167 |
VertexColorMap vertex_color, EdgeColorMap edge_color)
|
williamr@2
|
168 |
{
|
williamr@2
|
169 |
undirected_dfs(g, vis, vertex_color, edge_color, *vertices(g).first);
|
williamr@2
|
170 |
}
|
williamr@2
|
171 |
|
williamr@2
|
172 |
namespace detail {
|
williamr@2
|
173 |
template <typename VertexColorMap>
|
williamr@2
|
174 |
struct udfs_dispatch {
|
williamr@2
|
175 |
|
williamr@2
|
176 |
template <typename Graph, typename Vertex,
|
williamr@2
|
177 |
typename DFSVisitor, typename EdgeColorMap,
|
williamr@2
|
178 |
typename P, typename T, typename R>
|
williamr@2
|
179 |
static void
|
williamr@2
|
180 |
apply(const Graph& g, DFSVisitor vis, Vertex start_vertex,
|
williamr@2
|
181 |
const bgl_named_params<P, T, R>&,
|
williamr@2
|
182 |
EdgeColorMap edge_color,
|
williamr@2
|
183 |
VertexColorMap vertex_color)
|
williamr@2
|
184 |
{
|
williamr@2
|
185 |
undirected_dfs(g, vis, vertex_color, edge_color, start_vertex);
|
williamr@2
|
186 |
}
|
williamr@2
|
187 |
};
|
williamr@2
|
188 |
|
williamr@2
|
189 |
template <>
|
williamr@2
|
190 |
struct udfs_dispatch<detail::error_property_not_found> {
|
williamr@2
|
191 |
template <typename Graph, typename Vertex, typename DFSVisitor,
|
williamr@2
|
192 |
typename EdgeColorMap,
|
williamr@2
|
193 |
typename P, typename T, typename R>
|
williamr@2
|
194 |
static void
|
williamr@2
|
195 |
apply(const Graph& g, DFSVisitor vis, Vertex start_vertex,
|
williamr@2
|
196 |
const bgl_named_params<P, T, R>& params,
|
williamr@2
|
197 |
EdgeColorMap edge_color,
|
williamr@2
|
198 |
detail::error_property_not_found)
|
williamr@2
|
199 |
{
|
williamr@2
|
200 |
std::vector<default_color_type> color_vec(num_vertices(g));
|
williamr@2
|
201 |
default_color_type c = white_color; // avoid warning about un-init
|
williamr@2
|
202 |
undirected_dfs
|
williamr@2
|
203 |
(g, vis, make_iterator_property_map
|
williamr@2
|
204 |
(color_vec.begin(),
|
williamr@2
|
205 |
choose_const_pmap(get_param(params, vertex_index),
|
williamr@2
|
206 |
g, vertex_index), c),
|
williamr@2
|
207 |
edge_color,
|
williamr@2
|
208 |
start_vertex);
|
williamr@2
|
209 |
}
|
williamr@2
|
210 |
};
|
williamr@2
|
211 |
|
williamr@2
|
212 |
} // namespace detail
|
williamr@2
|
213 |
|
williamr@2
|
214 |
|
williamr@2
|
215 |
// Named Parameter Variant
|
williamr@2
|
216 |
template <typename Graph, typename P, typename T, typename R>
|
williamr@2
|
217 |
void
|
williamr@2
|
218 |
undirected_dfs(const Graph& g,
|
williamr@2
|
219 |
const bgl_named_params<P, T, R>& params)
|
williamr@2
|
220 |
{
|
williamr@2
|
221 |
typedef typename property_value< bgl_named_params<P, T, R>,
|
williamr@2
|
222 |
vertex_color_t>::type C;
|
williamr@2
|
223 |
detail::udfs_dispatch<C>::apply
|
williamr@2
|
224 |
(g,
|
williamr@2
|
225 |
choose_param(get_param(params, graph_visitor),
|
williamr@2
|
226 |
make_dfs_visitor(null_visitor())),
|
williamr@2
|
227 |
choose_param(get_param(params, root_vertex_t()),
|
williamr@2
|
228 |
*vertices(g).first),
|
williamr@2
|
229 |
params,
|
williamr@2
|
230 |
get_param(params, edge_color),
|
williamr@2
|
231 |
get_param(params, vertex_color)
|
williamr@2
|
232 |
);
|
williamr@2
|
233 |
}
|
williamr@2
|
234 |
|
williamr@2
|
235 |
|
williamr@2
|
236 |
template <typename IncidenceGraph, typename DFSVisitor,
|
williamr@2
|
237 |
typename VertexColorMap, typename EdgeColorMap>
|
williamr@2
|
238 |
void undirected_depth_first_visit
|
williamr@2
|
239 |
(const IncidenceGraph& g,
|
williamr@2
|
240 |
typename graph_traits<IncidenceGraph>::vertex_descriptor u,
|
williamr@2
|
241 |
DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color)
|
williamr@2
|
242 |
{
|
williamr@2
|
243 |
detail::undir_dfv_impl(g, u, vis, vertex_color, edge_color);
|
williamr@2
|
244 |
}
|
williamr@2
|
245 |
|
williamr@2
|
246 |
|
williamr@2
|
247 |
} // namespace boost
|
williamr@2
|
248 |
|
williamr@2
|
249 |
|
williamr@2
|
250 |
#endif
|