epoc32/include/stdapis/boost/graph/bandwidth.hpp
author William Roberts <williamr@symbian.org>
Tue, 16 Mar 2010 16:12:26 +0000
branchSymbian2
changeset 2 2fe1408b6811
permissions -rw-r--r--
Final list of Symbian^2 public API header files
williamr@2
     1
// Copyright (c) Jeremy Siek 2001, Marc Wintermantel 2002
williamr@2
     2
//
williamr@2
     3
// Distributed under the Boost Software License, Version 1.0. (See
williamr@2
     4
// accompanying file LICENSE_1_0.txt or copy at
williamr@2
     5
// http://www.boost.org/LICENSE_1_0.txt)
williamr@2
     6
williamr@2
     7
#ifndef BOOST_GRAPH_BANDWIDTH_HPP
williamr@2
     8
#define BOOST_GRAPH_BANDWIDTH_HPP
williamr@2
     9
williamr@2
    10
#include <algorithm> // for std::min and std::max
williamr@2
    11
#include <boost/config.hpp>
williamr@2
    12
#include <boost/graph/graph_traits.hpp>
williamr@2
    13
#include <boost/detail/numeric_traits.hpp>
williamr@2
    14
williamr@2
    15
namespace boost {
williamr@2
    16
williamr@2
    17
  template <typename Graph, typename VertexIndexMap>
williamr@2
    18
  typename graph_traits<Graph>::vertices_size_type
williamr@2
    19
  ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i,
williamr@2
    20
                const Graph& g,
williamr@2
    21
                VertexIndexMap index)
williamr@2
    22
  {
williamr@2
    23
    BOOST_USING_STD_MAX();
williamr@2
    24
    typedef typename graph_traits<Graph>::vertices_size_type size_type;
williamr@2
    25
    size_type b = 0;
williamr@2
    26
    typename graph_traits<Graph>::out_edge_iterator e, end;
williamr@2
    27
    for (tie(e, end) = out_edges(i, g); e != end; ++e) {
williamr@2
    28
      int f_i = get(index, i);
williamr@2
    29
      int f_j = get(index, target(*e, g));
williamr@2
    30
      using namespace std; // to call abs() unqualified
williamr@2
    31
      if(f_i > f_j)
williamr@2
    32
          b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, size_type(f_i - f_j));
williamr@2
    33
    }
williamr@2
    34
    return b;
williamr@2
    35
  }
williamr@2
    36
williamr@2
    37
  template <typename Graph>
williamr@2
    38
  typename graph_traits<Graph>::vertices_size_type
williamr@2
    39
  ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i,
williamr@2
    40
                const Graph& g)
williamr@2
    41
  {
williamr@2
    42
    return ith_bandwidth(i, g, get(vertex_index, g));
williamr@2
    43
  }
williamr@2
    44
williamr@2
    45
  template <typename Graph, typename VertexIndexMap>
williamr@2
    46
  typename graph_traits<Graph>::vertices_size_type
williamr@2
    47
  bandwidth(const Graph& g, VertexIndexMap index)
williamr@2
    48
  {
williamr@2
    49
    BOOST_USING_STD_MAX();
williamr@2
    50
    typename graph_traits<Graph>::vertices_size_type b = 0;
williamr@2
    51
    typename graph_traits<Graph>::vertex_iterator i, end;
williamr@2
    52
    for (tie(i, end) = vertices(g); i != end; ++i)
williamr@2
    53
        b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, ith_bandwidth(*i, g, index));
williamr@2
    54
    return b;
williamr@2
    55
  }
williamr@2
    56
williamr@2
    57
  template <typename Graph>
williamr@2
    58
  typename graph_traits<Graph>::vertices_size_type
williamr@2
    59
  bandwidth(const Graph& g)
williamr@2
    60
  {
williamr@2
    61
    return bandwidth(g, get(vertex_index, g));
williamr@2
    62
  }
williamr@2
    63
williamr@2
    64
  template <typename Graph, typename VertexIndexMap>
williamr@2
    65
  typename graph_traits<Graph>::vertices_size_type
williamr@2
    66
  edgesum(const Graph& g, VertexIndexMap index_map)
williamr@2
    67
  {
williamr@2
    68
    typedef typename graph_traits<Graph>::vertices_size_type size_type;
williamr@2
    69
    typedef typename detail::numeric_traits<size_type>::difference_type diff_t;
williamr@2
    70
    size_type sum = 0;
williamr@2
    71
    typename graph_traits<Graph>::edge_iterator i, end;
williamr@2
    72
    for (tie(i, end) = edges(g); i != end; ++i) {
williamr@2
    73
      diff_t f_u = get(index_map, source(*i, g));
williamr@2
    74
      diff_t f_v = get(index_map, target(*i, g));
williamr@2
    75
      using namespace std; // to call abs() unqualified
williamr@2
    76
      sum += abs(f_u - f_v);
williamr@2
    77
    }
williamr@2
    78
    return sum;
williamr@2
    79
  }
williamr@2
    80
  
williamr@2
    81
} // namespace boost
williamr@2
    82
williamr@2
    83
#endif // BOOST_GRAPH_BANDWIDTH_HPP