Chris@16
|
1 // (C) Copyright 2007-2009 Andrew Sutton
|
Chris@16
|
2 //
|
Chris@16
|
3 // Use, modification and distribution are subject to the
|
Chris@16
|
4 // Boost Software License, Version 1.0 (See accompanying file
|
Chris@16
|
5 // LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
6
|
Chris@16
|
7 #ifndef BOOST_GRAPH_ECCENTRICITY_HPP
|
Chris@16
|
8 #define BOOST_GRAPH_ECCENTRICITY_HPP
|
Chris@16
|
9
|
Chris@16
|
10 #include <boost/next_prior.hpp>
|
Chris@16
|
11 #include <boost/config.hpp>
|
Chris@16
|
12 #include <boost/graph/detail/geodesic.hpp>
|
Chris@16
|
13 #include <boost/concept/assert.hpp>
|
Chris@16
|
14
|
Chris@16
|
15 namespace boost
|
Chris@16
|
16 {
|
Chris@16
|
17 template <typename Graph,
|
Chris@16
|
18 typename DistanceMap,
|
Chris@16
|
19 typename Combinator>
|
Chris@16
|
20 inline typename property_traits<DistanceMap>::value_type
|
Chris@16
|
21 eccentricity(const Graph& g, DistanceMap dist, Combinator combine)
|
Chris@16
|
22 {
|
Chris@16
|
23 BOOST_CONCEPT_ASSERT(( GraphConcept<Graph> ));
|
Chris@16
|
24 typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
|
Chris@16
|
25 BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept<DistanceMap,Vertex> ));
|
Chris@16
|
26 typedef typename property_traits<DistanceMap>::value_type Distance;
|
Chris@16
|
27
|
Chris@16
|
28 return detail::combine_distances(g, dist, combine, Distance(0));
|
Chris@16
|
29 }
|
Chris@16
|
30
|
Chris@16
|
31 template <typename Graph, typename DistanceMap>
|
Chris@16
|
32 inline typename property_traits<DistanceMap>::value_type
|
Chris@16
|
33 eccentricity(const Graph& g, DistanceMap dist)
|
Chris@16
|
34 {
|
Chris@16
|
35 BOOST_CONCEPT_ASSERT(( GraphConcept<Graph> ));
|
Chris@16
|
36 typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
|
Chris@16
|
37 BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept<DistanceMap,Vertex> ));
|
Chris@16
|
38 typedef typename property_traits<DistanceMap>::value_type Distance;
|
Chris@16
|
39
|
Chris@16
|
40 return eccentricity(g, dist, detail::maximize<Distance>());
|
Chris@16
|
41 }
|
Chris@16
|
42
|
Chris@16
|
43 template <typename Graph, typename DistanceMatrix, typename EccentricityMap>
|
Chris@16
|
44 inline std::pair<typename property_traits<EccentricityMap>::value_type,
|
Chris@16
|
45 typename property_traits<EccentricityMap>::value_type>
|
Chris@16
|
46 all_eccentricities(const Graph& g, const DistanceMatrix& dist, EccentricityMap ecc)
|
Chris@16
|
47 {
|
Chris@16
|
48 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
|
Chris@16
|
49 typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
|
Chris@16
|
50 typedef typename graph_traits<Graph>::vertex_iterator VertexIterator;
|
Chris@16
|
51 BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept<DistanceMatrix,Vertex> ));
|
Chris@16
|
52 typedef typename property_traits<DistanceMatrix>::value_type DistanceMap;
|
Chris@16
|
53 BOOST_CONCEPT_ASSERT(( WritablePropertyMapConcept<EccentricityMap,Vertex> ));
|
Chris@16
|
54 typedef typename property_traits<EccentricityMap>::value_type Eccentricity;
|
Chris@16
|
55 BOOST_USING_STD_MIN();
|
Chris@16
|
56 BOOST_USING_STD_MAX();
|
Chris@16
|
57
|
Chris@16
|
58 Eccentricity
|
Chris@16
|
59 r = numeric_values<Eccentricity>::infinity(),
|
Chris@16
|
60 d = numeric_values<Eccentricity>::zero();
|
Chris@16
|
61 VertexIterator i, end;
|
Chris@16
|
62 boost::tie(i, end) = vertices(g);
|
Chris@16
|
63 for(boost::tie(i, end) = vertices(g); i != end; ++i) {
|
Chris@16
|
64 DistanceMap dm = get(dist, *i);
|
Chris@16
|
65 Eccentricity e = eccentricity(g, dm);
|
Chris@16
|
66 put(ecc, *i, e);
|
Chris@16
|
67
|
Chris@16
|
68 // track the radius and diameter at the same time
|
Chris@16
|
69 r = min BOOST_PREVENT_MACRO_SUBSTITUTION (r, e);
|
Chris@16
|
70 d = max BOOST_PREVENT_MACRO_SUBSTITUTION (d, e);
|
Chris@16
|
71 }
|
Chris@16
|
72 return std::make_pair(r, d);
|
Chris@16
|
73 }
|
Chris@16
|
74
|
Chris@16
|
75 template <typename Graph, typename EccentricityMap>
|
Chris@16
|
76 inline std::pair<typename property_traits<EccentricityMap>::value_type,
|
Chris@16
|
77 typename property_traits<EccentricityMap>::value_type>
|
Chris@16
|
78 radius_and_diameter(const Graph& g, EccentricityMap ecc)
|
Chris@16
|
79 {
|
Chris@16
|
80 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
|
Chris@16
|
81 typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
|
Chris@16
|
82 typedef typename graph_traits<Graph>::vertex_iterator VertexIterator;
|
Chris@16
|
83 BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept<EccentricityMap, Vertex> ));
|
Chris@16
|
84 typedef typename property_traits<EccentricityMap>::value_type Eccentricity;
|
Chris@16
|
85 BOOST_USING_STD_MIN();
|
Chris@16
|
86 BOOST_USING_STD_MAX();
|
Chris@16
|
87
|
Chris@16
|
88 VertexIterator i, end;
|
Chris@16
|
89 boost::tie(i, end) = vertices(g);
|
Chris@16
|
90 Eccentricity radius = get(ecc, *i);
|
Chris@16
|
91 Eccentricity diameter = get(ecc, *i);
|
Chris@16
|
92 for(i = boost::next(i); i != end; ++i) {
|
Chris@16
|
93 Eccentricity cur = get(ecc, *i);
|
Chris@16
|
94 radius = min BOOST_PREVENT_MACRO_SUBSTITUTION (radius, cur);
|
Chris@16
|
95 diameter = max BOOST_PREVENT_MACRO_SUBSTITUTION (diameter, cur);
|
Chris@16
|
96 }
|
Chris@16
|
97 return std::make_pair(radius, diameter);
|
Chris@16
|
98 }
|
Chris@16
|
99
|
Chris@16
|
100
|
Chris@16
|
101 template <typename Graph, typename EccentricityMap>
|
Chris@16
|
102 inline typename property_traits<EccentricityMap>::value_type
|
Chris@16
|
103 radius(const Graph& g, EccentricityMap ecc)
|
Chris@16
|
104 { return radius_and_diameter(g, ecc).first; }
|
Chris@16
|
105
|
Chris@16
|
106
|
Chris@16
|
107 template <typename Graph, typename EccentricityMap>
|
Chris@16
|
108 inline typename property_traits<EccentricityMap>::value_type
|
Chris@16
|
109 diameter(const Graph& g, EccentricityMap ecc)
|
Chris@16
|
110 { return radius_and_diameter(g, ecc).second; }
|
Chris@16
|
111
|
Chris@16
|
112 } /* namespace boost */
|
Chris@16
|
113
|
Chris@16
|
114 #endif
|