williamr@2: // Copyright (c) Jeremy Siek 2001, Marc Wintermantel 2002
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: #ifndef BOOST_GRAPH_BANDWIDTH_HPP
williamr@2: #define BOOST_GRAPH_BANDWIDTH_HPP
williamr@2: 
williamr@2: #include <algorithm> // for std::min and std::max
williamr@2: #include <boost/config.hpp>
williamr@2: #include <boost/graph/graph_traits.hpp>
williamr@2: #include <boost/detail/numeric_traits.hpp>
williamr@2: 
williamr@2: namespace boost {
williamr@2: 
williamr@2:   template <typename Graph, typename VertexIndexMap>
williamr@2:   typename graph_traits<Graph>::vertices_size_type
williamr@2:   ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i,
williamr@2:                 const Graph& g,
williamr@2:                 VertexIndexMap index)
williamr@2:   {
williamr@2:     BOOST_USING_STD_MAX();
williamr@2:     typedef typename graph_traits<Graph>::vertices_size_type size_type;
williamr@2:     size_type b = 0;
williamr@2:     typename graph_traits<Graph>::out_edge_iterator e, end;
williamr@2:     for (tie(e, end) = out_edges(i, g); e != end; ++e) {
williamr@2:       int f_i = get(index, i);
williamr@2:       int f_j = get(index, target(*e, g));
williamr@2:       using namespace std; // to call abs() unqualified
williamr@2:       if(f_i > f_j)
williamr@2:           b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, size_type(f_i - f_j));
williamr@2:     }
williamr@2:     return b;
williamr@2:   }
williamr@2: 
williamr@2:   template <typename Graph>
williamr@2:   typename graph_traits<Graph>::vertices_size_type
williamr@2:   ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i,
williamr@2:                 const Graph& g)
williamr@2:   {
williamr@2:     return ith_bandwidth(i, g, get(vertex_index, g));
williamr@2:   }
williamr@2: 
williamr@2:   template <typename Graph, typename VertexIndexMap>
williamr@2:   typename graph_traits<Graph>::vertices_size_type
williamr@2:   bandwidth(const Graph& g, VertexIndexMap index)
williamr@2:   {
williamr@2:     BOOST_USING_STD_MAX();
williamr@2:     typename graph_traits<Graph>::vertices_size_type b = 0;
williamr@2:     typename graph_traits<Graph>::vertex_iterator i, end;
williamr@2:     for (tie(i, end) = vertices(g); i != end; ++i)
williamr@2:         b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, ith_bandwidth(*i, g, index));
williamr@2:     return b;
williamr@2:   }
williamr@2: 
williamr@2:   template <typename Graph>
williamr@2:   typename graph_traits<Graph>::vertices_size_type
williamr@2:   bandwidth(const Graph& g)
williamr@2:   {
williamr@2:     return bandwidth(g, get(vertex_index, g));
williamr@2:   }
williamr@2: 
williamr@2:   template <typename Graph, typename VertexIndexMap>
williamr@2:   typename graph_traits<Graph>::vertices_size_type
williamr@2:   edgesum(const Graph& g, VertexIndexMap index_map)
williamr@2:   {
williamr@2:     typedef typename graph_traits<Graph>::vertices_size_type size_type;
williamr@2:     typedef typename detail::numeric_traits<size_type>::difference_type diff_t;
williamr@2:     size_type sum = 0;
williamr@2:     typename graph_traits<Graph>::edge_iterator i, end;
williamr@2:     for (tie(i, end) = edges(g); i != end; ++i) {
williamr@2:       diff_t f_u = get(index_map, source(*i, g));
williamr@2:       diff_t f_v = get(index_map, target(*i, g));
williamr@2:       using namespace std; // to call abs() unqualified
williamr@2:       sum += abs(f_u - f_v);
williamr@2:     }
williamr@2:     return sum;
williamr@2:   }
williamr@2:   
williamr@2: } // namespace boost
williamr@2: 
williamr@2: #endif // BOOST_GRAPH_BANDWIDTH_HPP