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