Chris@16: //
Chris@16: //=======================================================================
Chris@16: // Copyright 2002 Marc Wintermantel (wintermantel@even-ag.ch)
Chris@16: // ETH Zurich, Center of Structure Technologies (www.imes.ethz.ch/st)
Chris@16: //
Chris@16: // Distributed under the Boost Software License, Version 1.0. (See
Chris@16: // accompanying file LICENSE_1_0.txt or copy at
Chris@16: // http://www.boost.org/LICENSE_1_0.txt)
Chris@16: //=======================================================================
Chris@16: //
Chris@16: 
Chris@16: #ifndef BOOST_GRAPH_WAVEFRONT_HPP
Chris@16: #define BOOST_GRAPH_WAVEFRONT_HPP
Chris@16: 
Chris@16: #include <boost/config.hpp>
Chris@16: #include <boost/graph/graph_traits.hpp>
Chris@16: #include <boost/detail/numeric_traits.hpp>
Chris@16: #include <boost/graph/bandwidth.hpp>
Chris@16: #include <boost/config/no_tr1/cmath.hpp>
Chris@16: #include <vector>
Chris@16: #include <algorithm> // for std::min and std::max
Chris@16: 
Chris@16: namespace boost {
Chris@16: 
Chris@16:   template <typename Graph, typename VertexIndexMap>
Chris@16:   typename graph_traits<Graph>::vertices_size_type
Chris@16:   ith_wavefront(typename graph_traits<Graph>::vertex_descriptor i,
Chris@16:                 const Graph& g,
Chris@16:                 VertexIndexMap index)
Chris@16:   {
Chris@16:     typename graph_traits<Graph>::vertex_descriptor v, w;
Chris@16:     typename graph_traits<Graph>::vertices_size_type b = 1;
Chris@16:     typename graph_traits<Graph>::out_edge_iterator edge_it2, edge_it2_end; 
Chris@16:     typename graph_traits<Graph>::vertices_size_type index_i = index[i];
Chris@16:     std::vector<bool> rows_active(num_vertices(g), false);
Chris@16: 
Chris@16:     rows_active[index_i] = true;
Chris@16:       
Chris@16:       typename graph_traits<Graph>::vertex_iterator ui, ui_end;
Chris@16:       for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui)
Chris@16:       {
Chris@16:         v = *ui;
Chris@16:           if(index[v] <= index_i)
Chris@16:             {
Chris@16:               for (boost::tie(edge_it2, edge_it2_end) = out_edges(v, g); edge_it2 != edge_it2_end; ++edge_it2)
Chris@16:               {
Chris@16:                 w = target(*edge_it2, g);
Chris@16:                 if( (index[w] >= index_i) && (!rows_active[index[w]]) )
Chris@16:                   {
Chris@16:                     b++;
Chris@16:                     rows_active[index[w]] = true;
Chris@16:                   }
Chris@16:               }
Chris@16:             }
Chris@16:       }
Chris@16:  
Chris@16:     return b;
Chris@16:   }
Chris@16: 
Chris@16: 
Chris@16:   template <typename Graph>
Chris@16:   typename graph_traits<Graph>::vertices_size_type
Chris@16:   ith_wavefront(typename graph_traits<Graph>::vertex_descriptor i,
Chris@16:                 const Graph& g)
Chris@16:   {
Chris@16:     return ith_wavefront(i, g, get(vertex_index, g));
Chris@16:   }
Chris@16: 
Chris@16: 
Chris@16:   template <typename Graph, typename VertexIndexMap>
Chris@16:   typename graph_traits<Graph>::vertices_size_type
Chris@16:   max_wavefront(const Graph& g, VertexIndexMap index)
Chris@16:   {
Chris@16:     BOOST_USING_STD_MAX();
Chris@16:     typename graph_traits<Graph>::vertices_size_type b = 0;
Chris@16:     typename graph_traits<Graph>::vertex_iterator i, end;
Chris@16:     for (boost::tie(i, end) = vertices(g); i != end; ++i)
Chris@16:       b = max BOOST_PREVENT_MACRO_SUBSTITUTION(b, ith_wavefront(*i, g, index));
Chris@16:     return b;
Chris@16:   }
Chris@16: 
Chris@16:   template <typename Graph>
Chris@16:   typename graph_traits<Graph>::vertices_size_type
Chris@16:   max_wavefront(const Graph& g)
Chris@16:   {
Chris@16:     return max_wavefront(g, get(vertex_index, g));
Chris@16:   }
Chris@16: 
Chris@16: 
Chris@16:   template <typename Graph, typename VertexIndexMap>
Chris@16:   double
Chris@16:   aver_wavefront(const Graph& g, VertexIndexMap index)
Chris@16:   {
Chris@16:     double b = 0;
Chris@16:     typename graph_traits<Graph>::vertex_iterator i, end;
Chris@16:     for (boost::tie(i, end) = vertices(g); i != end; ++i)
Chris@16:       b += ith_wavefront(*i, g, index);
Chris@16: 
Chris@16:     b /= num_vertices(g);
Chris@16:     return b;
Chris@16:   }
Chris@16: 
Chris@16:   template <typename Graph>
Chris@16:   double
Chris@16:   aver_wavefront(const Graph& g)
Chris@16:   {
Chris@16:     return aver_wavefront(g, get(vertex_index, g));
Chris@16:   }
Chris@16: 
Chris@16: 
Chris@16:   template <typename Graph, typename VertexIndexMap>
Chris@16:   double
Chris@16:   rms_wavefront(const Graph& g, VertexIndexMap index)
Chris@16:   {
Chris@16:     double b = 0;
Chris@16:     typename graph_traits<Graph>::vertex_iterator i, end;
Chris@16:     for (boost::tie(i, end) = vertices(g); i != end; ++i)
Chris@16:       b += std::pow(double ( ith_wavefront(*i, g, index) ), 2.0);
Chris@16: 
Chris@16:     b /= num_vertices(g);
Chris@16: 
Chris@16:     return std::sqrt(b);
Chris@16:   }
Chris@16: 
Chris@16:   template <typename Graph>
Chris@16:   double
Chris@16:   rms_wavefront(const Graph& g)
Chris@16:   {
Chris@16:     return rms_wavefront(g, get(vertex_index, g));
Chris@16:   }
Chris@16:  
Chris@16:   
Chris@16: } // namespace boost
Chris@16: 
Chris@16: #endif // BOOST_GRAPH_WAVEFRONT_HPP