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