williamr@2: // williamr@2: //======================================================================= williamr@2: // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. williamr@2: // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek williamr@2: // williamr@2: // Distributed under the Boost Software License, Version 1.0. (See williamr@2: // accompanying file LICENSE_1_0.txt or copy at williamr@2: // http://www.boost.org/LICENSE_1_0.txt) williamr@2: //======================================================================= williamr@2: // williamr@2: #ifndef BOOST_GRAPH_UNDIRECTED_DFS_HPP williamr@2: #define BOOST_GRAPH_UNDIRECTED_DFS_HPP williamr@2: williamr@2: #include williamr@2: #include williamr@2: williamr@2: namespace boost { williamr@2: williamr@2: namespace detail { williamr@2: williamr@2: // Define BOOST_RECURSIVE_DFS to use older, recursive version. williamr@2: // It is retained for a while in order to perform performance williamr@2: // comparison. williamr@2: #ifndef BOOST_RECURSIVE_DFS williamr@2: williamr@2: template williamr@2: void undir_dfv_impl williamr@2: (const IncidenceGraph& g, williamr@2: typename graph_traits::vertex_descriptor u, williamr@2: DFSVisitor& vis, williamr@2: VertexColorMap vertex_color, williamr@2: EdgeColorMap edge_color) williamr@2: { williamr@2: function_requires >(); williamr@2: function_requires >(); williamr@2: typedef typename graph_traits::vertex_descriptor Vertex; williamr@2: typedef typename graph_traits::edge_descriptor Edge; williamr@2: function_requires >(); williamr@2: function_requires >(); williamr@2: typedef typename property_traits::value_type ColorValue; williamr@2: typedef typename property_traits::value_type EColorValue; williamr@2: function_requires< ColorValueConcept >(); williamr@2: function_requires< ColorValueConcept >(); williamr@2: typedef color_traits Color; williamr@2: typedef color_traits EColor; williamr@2: typedef typename graph_traits::out_edge_iterator Iter; williamr@2: typedef std::pair > VertexInfo; williamr@2: williamr@2: std::vector stack; williamr@2: williamr@2: put(vertex_color, u, Color::gray()); williamr@2: vis.discover_vertex(u, g); williamr@2: stack.push_back(std::make_pair(u, out_edges(u, g))); williamr@2: while (!stack.empty()) { williamr@2: VertexInfo& back = stack.back(); williamr@2: u = back.first; williamr@2: Iter ei, ei_end; williamr@2: tie(ei, ei_end) = back.second; williamr@2: stack.pop_back(); williamr@2: while (ei != ei_end) { williamr@2: Vertex v = target(*ei, g); williamr@2: vis.examine_edge(*ei, g); williamr@2: ColorValue v_color = get(vertex_color, v); williamr@2: EColorValue uv_color = get(edge_color, *ei); williamr@2: put(edge_color, *ei, EColor::black()); williamr@2: if (v_color == Color::white()) { williamr@2: vis.tree_edge(*ei, g); williamr@2: stack.push_back(std::make_pair(u, std::make_pair(++ei, ei_end))); williamr@2: u = v; williamr@2: put(vertex_color, u, Color::gray()); williamr@2: vis.discover_vertex(u, g); williamr@2: tie(ei, ei_end) = out_edges(u, g); williamr@2: } else if (v_color == Color::gray()) { williamr@2: if (uv_color == EColor::white()) vis.back_edge(*ei, g); williamr@2: ++ei; williamr@2: } else { // if (v_color == Color::black()) williamr@2: ++ei; williamr@2: } williamr@2: } williamr@2: put(vertex_color, u, Color::black()); williamr@2: vis.finish_vertex(u, g); williamr@2: } williamr@2: } williamr@2: williamr@2: #else // BOOST_RECURSIVE_DFS williamr@2: williamr@2: template williamr@2: void undir_dfv_impl williamr@2: (const IncidenceGraph& g, williamr@2: typename graph_traits::vertex_descriptor u, williamr@2: DFSVisitor& vis, // pass-by-reference here, important! williamr@2: VertexColorMap vertex_color, williamr@2: EdgeColorMap edge_color) williamr@2: { williamr@2: function_requires >(); williamr@2: function_requires >(); williamr@2: typedef typename graph_traits::vertex_descriptor Vertex; williamr@2: typedef typename graph_traits::edge_descriptor Edge; williamr@2: function_requires >(); williamr@2: function_requires >(); williamr@2: typedef typename property_traits::value_type ColorValue; williamr@2: typedef typename property_traits::value_type EColorValue; williamr@2: function_requires< ColorValueConcept >(); williamr@2: function_requires< ColorValueConcept >(); williamr@2: typedef color_traits Color; williamr@2: typedef color_traits EColor; williamr@2: typename graph_traits::out_edge_iterator ei, ei_end; williamr@2: williamr@2: put(vertex_color, u, Color::gray()); vis.discover_vertex(u, g); williamr@2: for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) { williamr@2: Vertex v = target(*ei, g); vis.examine_edge(*ei, g); williamr@2: ColorValue v_color = get(vertex_color, v); williamr@2: EColorValue uv_color = get(edge_color, *ei); williamr@2: put(edge_color, *ei, EColor::black()); williamr@2: if (v_color == Color::white()) { vis.tree_edge(*ei, g); williamr@2: undir_dfv_impl(g, v, vis, vertex_color, edge_color); williamr@2: } else if (v_color == Color::gray() && uv_color == EColor::white()) williamr@2: vis.back_edge(*ei, g); williamr@2: } williamr@2: put(vertex_color, u, Color::black()); vis.finish_vertex(u, g); williamr@2: } williamr@2: williamr@2: #endif // ! BOOST_RECURSIVE_DFS williamr@2: williamr@2: } // namespace detail williamr@2: williamr@2: template williamr@2: void williamr@2: undirected_dfs(const Graph& g, DFSVisitor vis, williamr@2: VertexColorMap vertex_color, EdgeColorMap edge_color, williamr@2: Vertex start_vertex) williamr@2: { williamr@2: function_requires >(); williamr@2: function_requires >(); williamr@2: williamr@2: typedef typename property_traits::value_type ColorValue; williamr@2: typedef color_traits Color; williamr@2: williamr@2: typename graph_traits::vertex_iterator ui, ui_end; williamr@2: for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) { williamr@2: put(vertex_color, *ui, Color::white()); vis.initialize_vertex(*ui, g); williamr@2: } williamr@2: typename graph_traits::edge_iterator ei, ei_end; williamr@2: for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) williamr@2: put(edge_color, *ei, Color::white()); williamr@2: williamr@2: if (start_vertex != *vertices(g).first){ vis.start_vertex(start_vertex, g); williamr@2: detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color); williamr@2: } williamr@2: williamr@2: for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) { williamr@2: ColorValue u_color = get(vertex_color, *ui); williamr@2: if (u_color == Color::white()) { vis.start_vertex(*ui, g); williamr@2: detail::undir_dfv_impl(g, *ui, vis, vertex_color, edge_color); williamr@2: } williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: undirected_dfs(const Graph& g, DFSVisitor vis, williamr@2: VertexColorMap vertex_color, EdgeColorMap edge_color) williamr@2: { williamr@2: undirected_dfs(g, vis, vertex_color, edge_color, *vertices(g).first); williamr@2: } williamr@2: williamr@2: namespace detail { williamr@2: template williamr@2: struct udfs_dispatch { williamr@2: williamr@2: template williamr@2: static void williamr@2: apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, williamr@2: const bgl_named_params&, williamr@2: EdgeColorMap edge_color, williamr@2: VertexColorMap vertex_color) williamr@2: { williamr@2: undirected_dfs(g, vis, vertex_color, edge_color, start_vertex); williamr@2: } williamr@2: }; williamr@2: williamr@2: template <> williamr@2: struct udfs_dispatch { williamr@2: template williamr@2: static void williamr@2: apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, williamr@2: const bgl_named_params& params, williamr@2: EdgeColorMap edge_color, williamr@2: detail::error_property_not_found) williamr@2: { williamr@2: std::vector color_vec(num_vertices(g)); williamr@2: default_color_type c = white_color; // avoid warning about un-init williamr@2: undirected_dfs williamr@2: (g, vis, make_iterator_property_map williamr@2: (color_vec.begin(), williamr@2: choose_const_pmap(get_param(params, vertex_index), williamr@2: g, vertex_index), c), williamr@2: edge_color, williamr@2: start_vertex); williamr@2: } williamr@2: }; williamr@2: williamr@2: } // namespace detail williamr@2: williamr@2: williamr@2: // Named Parameter Variant williamr@2: template williamr@2: void williamr@2: undirected_dfs(const Graph& g, williamr@2: const bgl_named_params& params) williamr@2: { williamr@2: typedef typename property_value< bgl_named_params, williamr@2: vertex_color_t>::type C; williamr@2: detail::udfs_dispatch::apply williamr@2: (g, williamr@2: choose_param(get_param(params, graph_visitor), williamr@2: make_dfs_visitor(null_visitor())), williamr@2: choose_param(get_param(params, root_vertex_t()), williamr@2: *vertices(g).first), williamr@2: params, williamr@2: get_param(params, edge_color), williamr@2: get_param(params, vertex_color) williamr@2: ); williamr@2: } williamr@2: williamr@2: williamr@2: template williamr@2: void undirected_depth_first_visit williamr@2: (const IncidenceGraph& g, williamr@2: typename graph_traits::vertex_descriptor u, williamr@2: DFSVisitor vis, VertexColorMap vertex_color, EdgeColorMap edge_color) williamr@2: { williamr@2: detail::undir_dfv_impl(g, u, vis, vertex_color, edge_color); williamr@2: } williamr@2: williamr@2: williamr@2: } // namespace boost williamr@2: williamr@2: williamr@2: #endif