/Src/Dependencies/Boost/boost/graph/undirected_dfs.hpp

http://hadesmem.googlecode.com/ · C++ Header · 250 lines · 206 code · 30 blank · 14 comment · 30 complexity · b4f7354669751b86f0efab42a5960441 MD5 · raw file

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